Leetcode 1094 car pooling (Analog)

There is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west).

You are given the integer capacity and an array trips where trips[i] = [numPassengersi, fromi, toi] indicates that the ith trip has numPassengersi passengers and the locations to pick them up and drop them off are fromi and toi respectively. The locations are given as the number of kilometers due east from the car's initial location.

Return true if it is possible to pick up and drop off all passengers for all the given trips, or false otherwise.

Example 1:

Input: trips = [[2,1,5],[3,3,7]], capacity = 4
Output: false

Example 2:

Input: trips = [[2,1,5],[3,3,7]], capacity = 5
Output: true

Constraints:

• 1 <= trips.length <= 1000
• trips[i].length == 3
• 1 <= numPassengersi <= 100
• 0 <= fromi < toi <= 1000
• 1 <= capacity <= 105

Topic link ：https://leetcode.com/problems/car-pooling/

The main idea of the topic ： The capacity of a given vehicle is capacity And the number of passengers in each section , Ask if you can take all the passengers to their destination

Topic analysis ： Simulate getting on and off according to the meaning of the question , If the number of people on the train at a certain time is greater than capacity No way.

0ms, Time beats 100%

class Solution {
    public boolean carPooling(int[][] trips, int capacity) {
        int[] cnt = new int[1005];
        int ma = 0, pcur = 0;
        for (int i = 0; i < trips.length; i++) {
            cnt[trips[i][1]] += trips[i][0];
            cnt[trips[i][2]] -= trips[i][0];
            ma = Math.max(ma, to);
        }
        for (int i = 0; i <= ma; i++) {
            pcur += cnt[i];
            if (pcur > capacity) {
                return false;
            }
        }
        return true;
    }
}