_1094.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Arrays;
importjava.util.PriorityQueue;

publicclass_1094 {
publicstaticclassSolution1 {
publicbooleancarPooling(int[][] trips, intcapacity) {
Arrays.sort(trips, (a, b) -> a[1] - b[1]);
PriorityQueue<int[]> heap = newPriorityQueue<>((a, b) -> a[1] - b[1]);
for (int[] trip : trips) {
intstartTime = trip[1];
intendTime = trip[2];
while (!heap.isEmpty() && heap.peek()[1] <= startTime) {
int[] curr = heap.poll();
capacity += curr[0];
 }
intpeopleCnt = trip[0];
capacity -= peopleCnt;
if (capacity < 0) {
returnfalse;
 }
heap.offer(newint[] {peopleCnt, endTime});
 }
returntrue;
 }
 }
}