• Home
• com.github.javadev
• leetcode-in-java21
• 1.26
• source code
• Solution.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1001_1100.s1094_car_pooling.Solution Maven / Gradle / Ivy

package g1001_1100.s1094_car_pooling;

// #Medium #Array #Sorting #Heap_Priority_Queue #Simulation #Prefix_Sum
// #2022_02_22_Time_1_ms_(99.38%)_Space_44.4_MB_(9.80%)

/**
 * 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 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
**/
public class Solution {
    public boolean carPooling(int[][] trips, int capacity) {
        int[] stops = new int[1001];
        for (int[] t : trips) {
            stops[t[1]] += t[0];
            stops[t[2]] -= t[0];
        }
        for (int i = 0; capacity >= 0 && i < 1001; ++i) {
            capacity -= stops[i];
        }
        return capacity >= 0;
    }
}