1094. Car Pooling

Posted on Edited on In

1094. Car Pooling

Description

Difficulty: Medium

Related Topics: Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum

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:

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

Example 2:

1
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

Hints/Notes

  • Use the diff array

Solution

Language: C++

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class Solution {
public:
    bool carPooling(vector<vector<int>>& trips, int capacity) {
        vector<int> diffs(1001, 0);
        for (vector<int> trip : trips) {
            int val = trip[0], from = trip[1], to = trip[2] - 1;
            diffs[from] += val;
            if (to + 1 < diffs.size()) {
                diffs[to + 1] -= val;
            }
        }
        vector<int> numPassengers;
        if (diffs[0] > capacity) {
            return false;
        } else {
            numPassengers.push_back(diffs[0]);
        }
        for (int i = 1; i < diffs.size(); i++) {
            numPassengers.push_back(numPassengers[i - 1] + diffs[i]);
            if (numPassengers[i] > capacity) {
                return false;
            }
        }
        return true;
    }
};