We can simulate the number of passengers in the car at each kilometer using a difference array. For each trip, increase the passenger count at fromi and decrease it at toi. Then, iterate through this array to calculate the actual number of passengers at each point, checking if it ever exceeds the capacity.
Time Complexity: O(n + m) where n is the number of trips and m is the max distance (1000).
Space Complexity: O(m) for the difference array.
1def carPooling(trips, capacity):
2 passenger_changes = [0] * 1001
3
4 for num_passengers, start, end in trips:
5 passenger_changes[start] += num_passengers
6 passenger_changes[end] -= num_passengers
7
8 current_passengers = 0
9 for change in passenger_changes:
10 current_passengers += change
11 if current_passengers > capacity:
12 return False
13
14 return TrueA list passenger_changes schema simulates the number of passengers at any point. Passengers are adjusted using trip data, and evaluation ensures that counts remain within limits.
In this approach, we treat each pick-up and drop-off as events. We collect all events, sort them based on location, and then simulate the process of picking up and dropping off passengers by iterating through events in order, checking if it ever exceeds the car's capacity.
Time Complexity: O(n log n), driven by sorting events.
Space Complexity: O(n).
1import java.util.*;
2
3public class Solution {
4 public boolean carPooling(int[][] trips, int capacity) {
5 List<int[]> events = new ArrayList<>();
6
7 for (int[] trip : trips) {
8 events.add(new int[]{trip[1], trip[0]}); // pickup
9 events.add(new int[]{trip[2], -trip[0]}); // drop-off
10 }
11
12 events.sort((a, b) -> a[0] - b[0]);
13
14 int currentPassengers = 0;
15 for (int[] event : events) {
16 currentPassengers += event[1];
17 if (currentPassengers > capacity) return false;
18 }
19
20 return true;
21 }
22}Represented as pick-up and drop-off events, we sort and sequentially evaluate each event in terms of its change to car burdens, returning a boolean determination.