Class Solution
-
- All Implemented Interfaces:
public final class Solution
1094 - Car Pooling\.
Medium
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 arraytrips
where <code>tripsi = numPassengers<sub>i</sub>, from<sub>i</sub>, to<sub>i</sub></code> indicates that the <code>i<sup>th</sup></code> trip has <code>numPassengers<sub>i</sub></code> passengers and the locations to pick them up and drop them off are <code>from<sub>i</sub></code> and <code>to<sub>i</sub></code> 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, orfalse
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
<code>1 <= numPassengers<sub>i</sub><= 100</code>
<code>0 <= from<sub>i</sub>< to<sub>i</sub><= 1000</code>
<code>1 <= capacity <= 10<sup>5</sup></code>