Skip to content

Latest commit

 

History

History
 
 

0853.car-fleet

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 

题目

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

Each car ihas 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 drivingat 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 willstill beconsidered 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:

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

解题思路

见程序注释