| # | User | Rating |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 165 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | maroonrk | 152 |
| 5 | -is-this-fft- | 151 |
| 5 | nor | 151 |
| 7 | atcoder_official | 147 |
| 8 | TheScrasse | 146 |
| 9 | Petr | 145 |
| 10 | SecondThread | 142 |
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.