Update 1642-furthest-building-you-can-reach.java #783

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed

Max-CoderBoi wants to merge 1 commit into codemistic:main from Max-CoderBoi:patch-20

Closed

Changes from all commits

Commits

Select commit

File filter

Conversations

Jump to

Jump to file

Failed to load files.

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -1,16 +1,28 @@
	import java.util.PriorityQueue;

		class Solution {
		public int furthestBuilding(int[] heights, int bricks, int ladders) {
	PriorityQueue<Integer> pq = new PriorityQueue<>();
	for(int i=0;i<heights.length-1;i++)
	{
	int distance = heights[i+1] - heights[i];
	if(distance>0)
	PriorityQueue<Integer> pq = new PriorityQueue<>(); // Min heap to track used bricks
	int i = 0;

	for (; i < heights.length - 1; i++) {
	int distance = heights[i + 1] - heights[i];

	if (distance > 0) {
		pq.add(distance);
	if(pq.size()>ladders)
	bricks -= pq.poll();
	if(bricks<0)
	}

	// If we have used more ladders than available, replace the smallest ladder use with bricks
	if (pq.size() > ladders) {
	bricks -= pq.poll(); // Convert the smallest ladder usage into bricks
	}

	// If bricks are exhausted, return the last possible building index
	if (bricks < 0) {
		return i;
	}
		}
	return heights.length-1;

	return i; // Reached the last building
		}
	}
	}

Navigation Menu