Description
You are given an integer array heights representing the heights of buildings, some bricks, and some ladders.
You start your journey from building 0 and move to the next building by possibly using bricks or ladders.
While moving from building i to building i+1 (0-indexed),
- If the current building’s height is greater than or equal to the next building’s height, you do not need a ladder or bricks.
- If the current building’s height is less than the next building’s height, you can either use one ladder or (h[i+1] - h[i]) bricks.
Return the furthest building index (0-indexed) you can reach if you use the given ladders and bricks optimally.
Example 1:
Input: heights = [4,2,7,6,9,14,12], bricks = 5, ladders = 1
Output: 4
Explanation: Starting at building 0, you can follow these steps:
- Go to building 1 without using ladders nor bricks since 4 >= 2.
- Go to building 2 using 5 bricks. You must use either bricks or ladders because 2 < 7.
- Go to building 3 without using ladders nor bricks since 7 >= 6.
- Go to building 4 using your only ladder. You must use either bricks or ladders because 6 < 9.
It is impossible to go beyond building 4 because you do not have any more bricks or ladders.
Example 2:
Input: heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2
Output: 7
Example 3:
Input: heights = [14,3,19,3], bricks = 17, ladders = 0
Output: 3
Constraints:
1 <= heights.length <= 10^5
1 <= heights[i] <= 10^6
0 <= bricks <= 10^9
0 <= ladders <= heights.length
Solution
Recursive + Memo (MLE)
When the current building is shorter than the next one, we can choose either ladder
or bricks
, so we do a recursive.
Heap
Solved after help… Why can they come up with this solution!!!
Use a heap to store all the height gaps we need to jump, if the length of the heap is larger than ladder, we can pop out the minimum gap to use bricks.
Time complexity:
o
(
n
log
k
)
o(n\log k)
o(nlogk), where n
is the length of heights
, and k
is ladder.
Space complexity:
o
(
k
)
o(k)
o(k)
Code
Recursive + memo
class Solution:
def furthestBuilding(self, heights: List[int], bricks: int, ladders: int) -> int:
memo = {}
def helper(index: int, bricks: int, ladders: int) -> int:
if (index, bricks, ladders) in memo:
return memo[(index, bricks, ladders)]
if index == len(heights) - 1:
memo[(index, bricks, ladders)] = index
return memo[(index, bricks, ladders)]
if index + 1 < len(heights):
if heights[index] >= heights[index + 1]:
memo[(index, bricks, ladders)] = helper(index + 1, bricks, ladders)
else:
candidates = []
if ladders > 0:
candidates.append(helper(index + 1, bricks, ladders - 1))
if heights[index + 1] - heights[index] <= bricks:
candidates.append(helper(index + 1, bricks - (heights[index + 1] - heights[index]), ladders))
if candidates:
memo[(index, bricks, ladders)] = max(candidates)
else:
memo[(index, bricks, ladders)] = index
return memo[(index, bricks, ladders)]
return helper(0, bricks, ladders)
Heap
class Solution:
def furthestBuilding(self, heights: List[int], bricks: int, ladders: int) -> int:
jump_diff = []
for i in range(1, len(heights)):
if heights[i] > heights[i - 1]:
heapq.heappush(jump_diff, heights[i] - heights[i - 1])
if len(jump_diff) > ladders:
bricks -= heapq.heappop(jump_diff)
if bricks < 0:
return i - 1
return len(heights) - 1