Car Pooling LeetCode solution in Java

1
class Solution {
2
  public boolean carPooling(int[][] trips, int capacity) {
3
    Map<Integer, Integer> destinationToPassengers = new TreeMap<>();
4
    for (int[] trip : trips) {
5
      int currPassengersAtPickup = destinationToPassengers.getOrDefault(trip[1], 0);
6
      int currPassengersAtDrop = destinationToPassengers.getOrDefault(trip[2], 0);
7
      destinationToPassengers.put(trip[1], currPassengersAtPickup + trip[0]);
8
      destinationToPassengers.put(trip[2], currPassengersAtDrop - trip[0]);
9
    }
10

11
    int currPassengers = 0;
12
    for (int passengers : destinationToPassengers.values()) {
13
      currPassengers += passengers;
14

15
      if (currPassengers > capacity) {
16
        return false;
17
      }
18
    }
19
    return true;
20
  }
21
}