| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Problem link — https://leetcode.com/problems/furthest-building-you-can-reach/
I am able to come up with the solution after some time but I still don't know and am not able to debug why my previous solution giving wrong answer for particular test case.Could anyone help me to figure it out?
code:
You can do this using binary search.
https://leetcode.com/submissions/detail/727789686/
Indentation might be a bit messed up, I wrote this on my phone.
phone programmers orz orz orz
exactly me on my way to specialist with a brain and a phone
Consider the case:
heights = [1, 5, 6, 7] bricks = 2 ladders = 0
Your code returns 2. But with only two bricks you cant even move a single building. So the correct answer would be 0.