853. Car Fleet

Description

N cars are going to the same destination along a one lane road. The destination is target miles away.

Each car i has a constant speed speed[i] (in miles per hour), and initial position position[i] miles towards the target along the road.

A car can never pass another car ahead of it, but it can catch up to it, and drive bumper to bumper at the same speed.

The distance between these two cars is ignored - they are assumed to have the same position.

A car fleet is some non-empty set of cars driving at the same position and same speed. Note that a single car is also a car fleet.

If a car catches up to a car fleet right at the destination point, it will still be considered as one car fleet.

How many car fleets will arrive at the destination?

Example 1:

Input: target = 12, position = [10,8,0,5,3], speed = [2,4,1,1,3]
Output: 3
Explanation:
The cars starting at 10 and 8 become a fleet, meeting each other at 12.
The car starting at 0 doesn’t catch up to any other car, so it is a fleet by itself.
The cars starting at 5 and 3 become a fleet, meeting each other at 6.
Note that no other cars meet these fleets before the destination, so the answer is 3.

Note:

0 <= N <= 10 ^ 4
0 < target <= 10 ^ 6
0 < speed[i] <= 10 ^ 6
0 <= position[i] < target
All initial positions are different.

Problem URL

---

Solution

N辆车要到target mile 处，每辆车有position[I]和speed[I]，车辆无法超车，如果遇到了前面的车辆就会跟着形成一个车队，车辆之间的距离忽略，认为在同一个位置。车队的定义是至少有一辆车组成的，拥有同样的位置和同样的速度。计算有多少个car fleet到达target。

Calculate time needed to arrive the target, sort by the start position.
Loop on each car from the end to the beginning. cur recorded the current biggest time (the slowest).
If another car needs less or equal time than cur, it can catch up this car.
Otherwise it will become the new slowest car, that is new lead of a car fleet.

Code

class Solution {
    public int carFleet(int target, int[] position, int[] speed) {
        Map<Integer, Double> map = new TreeMap<>();
        for (int i = 0; i < position.length; i++){
            map.put(-position[i], (double)(target - position[i]) / speed[i]);
        }
        int res = 0;
        double cur = 0;
        for (double time : map.values()){
            if (time > cur){
                cur = time;
                res++;
            }
        }
        return res;
    }
}

Time Complexity: O(nlogn)
Space Complexity: O(n)

---

Review