LeetCode 1094 Car Pooling (模拟)

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

题目链接：https://leetcode.com/problems/car-pooling/

题目大意：给定一个车的容量为capacity以及给每个区间段会上的乘客数，求能否搭载全部乘客到他们的目的地

题目分析：按照题意模拟上下车即可，若某个时刻车上人数大于capacity则不行

0ms，时间击败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;
    }
}