Package g1601_1700.s1642_furthest_building_you_can_reach

Class Solution

java.lang.Object

g1601_1700.s1642_furthest_building_you_can_reach.Solution

public class Solution
extends Object

1642 - Furthest Building You Can Reach.<p>Medium</p> <p>You are given an integer array <code>heights</code> representing the heights of buildings, some <code>bricks</code>, and some <code>ladders</code>.</p> <p>You start your journey from building <code>0</code> and move to the next building by possibly using bricks or ladders.</p> <p>While moving from building <code>i</code> to building <code>i+1</code> ( <strong>0-indexed</strong> ),</p> <ul> <li>If the current building&rsquo;s height is <strong>greater than or equal</strong> to the next building&rsquo;s height, you do <strong>not</strong> need a ladder or bricks.</li> <li>If the current building&rsquo;s height is <strong>less than</strong> the next building&rsquo;s height, you can either use <strong>one ladder</strong> or <code>(h[i+1] - h[i])</code> <strong>bricks</strong>.</li> </ul> <p><em>Return the furthest building index (0-indexed) you can reach if you use the given ladders and bricks optimally.</em></p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/10/27/q4.gif" alt="" /></p> <p><strong>Input:</strong> heights = [4,2,7,6,9,14,12], bricks = 5, ladders = 1</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> Starting at building 0, you can follow these steps:</p> <ul> <li> <p>Go to building 1 without using ladders nor bricks since 4 >= 2.</p> </li> <li> <p>Go to building 2 using 5 bricks. You must use either bricks or ladders because 2 < 7.</p> </li> <li> <p>Go to building 3 without using ladders nor bricks since 7 >= 6.</p> </li> <li> <p>Go to building 4 using your only ladder. You must use either bricks or ladders because 6 < 9.</p> </li> </ul> <p>It is impossible to go beyond building 4 because you do not have any more bricks or ladders.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> heights = [4,12,2,7,3,18,20,3,19], bricks = 10, ladders = 2</p> <p><strong>Output:</strong> 7</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> heights = [14,3,19,3], bricks = 17, ladders = 0</p> <p><strong>Output:</strong> 3</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= heights.length <= 10⁵</code></li> <li><code>1 <= heights[i] <= 10⁶</code></li> <li><code>0 <= bricks <= 10⁹</code></li> <li><code>0 <= ladders <= heights.length</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	furthestBuilding(int[] heights, int bricks, int ladders)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

furthestBuilding

public int furthestBuilding(int[] heights,
 int bricks,
 int ladders)