bricks. If bricks run out (bricks < 0), return the current index; otherwise, if all buildings are reachable, return the last index.
Code

[{"language":"C++","code":"class Solution {\npublic:\n    int furthestBuilding(vector<int>& heights, int bricks, int ladders) {\n        priority_queue<int, vector<int>, greater<int>> minHeap;\n        int n = heights.size();\n        for (int i = 0; i < n - 1; ++i) {\n            int diff = heights[i + 1] - heights[i];\n            if (diff > 0) {\n                minHeap.push(diff);\n            }\n            if (minHeap.size() > ladders) {\n                bricks -= minHeap.top();\n                minHeap.pop();\n            }\n            if (bricks < 0) {\n                return i;\n            }\n        }\n        return n - 1;\n    }\n};","lang":"cpp"},{"language":"Go","code":"type MinHeap []int\n\nfunc (h MinHeap) Len() int           { return len(h) }\nfunc (h MinHeap) Less(i, j int) bool { return h[i] < h[j] }\nfunc (h MinHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }\nfunc (h *MinHeap) Push(x interface{}) { *h = append(*h, x.(int)) }\nfunc (h *MinHeap) Pop() interface{} {\n    old := *h\n    n := len(old)\n    x := old[n-1]\n    *h = old[:n-1]\n    return x\n}\n\nfunc furthestBuilding(heights []int, bricks int, ladders int) int {\n    h := &MinHeap{}\n    heap.Init(h)\n    for i := 0; i < len(heights)-1; i++ {\n        diff := heights[i+1] - heights[i]\n        if diff > 0 {\n            heap.Push(h, diff)\n        }\n        if h.Len() > ladders {\n            bricks -= heap.Pop(h).(int)\n        }\n        if bricks < 0 {\n            return i\n        }\n    }\n    return len(heights) - 1\n}","lang":"go"},{"language":"Java","code":"class Solution {\n\tpublic int furthestBuilding(int[] heights, int bricks, int ladders) {\n\t\tPriorityQueue<Integer> pq = new PriorityQueue<>();\n\t\tfor (int i = 0; i < heights.length - 1; i++) {\n\t\t\tint diff = heights[i + 1] - heights[i];\n\t\t\tif (diff > 0) {\n\t\t\t\tpq.add(d);\n\t\t\t}\n\t\t\tif (pq.size() > ladders) {\n\t\t\t\tbricks -= pq.poll();\n\t\t\t}\n\t\t\tif (bricks<0) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t\treturn heights.length - 1;\n\t}\n}","lang":"java"},{"language":"Kotlin","code":"class Solution {\n    fun furthestBuilding(heights: IntArray, bricks: Int, ladders: Int): Int {\n        val minHeap = PriorityQueue<Int>()\n        var bricksLeft = bricks\n        for (i in 0 until heights.size - 1) {\n            val diff = heights[i + 1] - heights[i]\n            if (diff > 0) {\n                minHeap.add(diff)\n            }\n            if (minHeap.size > ladders) {\n                bricksLeft -= minHeap.poll()\n            }\n            if (bricksLeft < 0) {\n                return i\n            }\n        }\n        return heights.size - 1\n    }\n}","lang":"kotlin"},{"language":"Python","code":"class Solution:\n    def furthestBuilding(self, heights: List[int], bricks: int, ladders: int) -> int:\n        min_heap = []\n        for i in range(len(heights) - 1):\n            diff = heights[i + 1] - heights[i]\n            if diff > 0:\n                heapq.heappush(min_heap, diff)\n            if len(min_heap) > ladders:\n                bricks -= heapq.heappop(min_heap)\n            if bricks < 0:\n                return i\n        return len(heights) - 1","lang":"python"},{"language":"Rust","code":"impl Solution {\n    pub fn furthest_building(heights: Vec<i32>, mut bricks: i32, ladders: i32) -> i32 {\n        let mut min_heap = BinaryHeap::new();\n        let n = heights.len();\n        for i in 0..n - 1 {\n            let diff = heights[i + 1] - heights[i];\n            if diff > 0 {\n                min_heap.push(Reverse(diff));\n            }\n            if min_heap.len() > ladders as usize {\n                if let Some(Reverse(smallest)) = min_heap.pop() {\n                    bricks -= smallest;\n                }\n
Related Tags
