1094. Car Pooling.java

/*
https://leetcode.com/problems/car-pooling/
*/

class Solution {
    public boolean carPooling(int[][] trips, int capacity) {
        
        int[] pick = new int[1001], drop = new int[1001];
        for(int i=0;i<trips.length;i++) {
            pick[trips[i][1]]+=trips[i][0];
            drop[trips[i][2]]+=trips[i][0];
        }
        
        int sp = 1;
        while (sp < 1001) {
            if (drop[sp] > 0) capacity += drop[sp];
            if (pick[sp] > 0) {
                capacity -= pick[sp];
                if (capacity < 0) return false;
            }
            sp++;
        }
        
        return true;
    }
}