1776. Car Fleet II Hard

@problem@discussion
#Array#Math#Stack#Heap (Priority Queue)#Monotonic Stack



1/**
2 * [1776] Car Fleet II
3 *
4 * There are n cars traveling at different speeds in the same direction along a one-lane road. You are given an array cars of length n, where cars[i] = [positioni, speedi] represents:
5 * 
6 * 	positioni is the distance between the i^th car and the beginning of the road in meters. It is guaranteed that positioni < positioni+1.
7 * 	speedi is the initial speed of the i^th car in meters per second.
8 * 
9 * For simplicity, cars can be considered as points moving along the number line. Two cars collide when they occupy the same position. Once a car collides with another car, they unite and form a single car fleet. The cars in the formed fleet will have the same position and the same speed, which is the initial speed of the slowest car in the fleet.
10 * Return an array answer, where answer[i] is the time, in seconds, at which the i^th car collides with the next car, or -1 if the car does not collide with the next car. Answers within 10^-5 of the actual answers are accepted.
11 *  
12 * Example 1:
13 * 
14 * Input: cars = [[1,2],[2,1],[4,3],[7,2]]
15 * Output: [1.00000,-1.00000,3.00000,-1.00000]
16 * Explanation: After exactly one second, the first car will collide with the second car, and form a car fleet with speed 1 m/s. After exactly 3 seconds, the third car will collide with the fourth car, and form a car fleet with speed 2 m/s.
17 * 
18 * Example 2:
19 * 
20 * Input: cars = [[3,4],[5,4],[6,3],[9,1]]
21 * Output: [2.00000,1.00000,1.50000,-1.00000]
22 * 
23 *  
24 * Constraints:
25 * 
26 * 	1 <= cars.length <= 10^5
27 * 	1 <= positioni, speedi <= 10^6
28 * 	positioni < positioni+1
29 * 
30 */
31pub struct Solution {}
32
33// problem: https://leetcode.com/problems/car-fleet-ii/
34// discuss: https://leetcode.com/problems/car-fleet-ii/discuss/?currentPage=1&orderBy=most_votes&query=
35
36// submission codes start here
37
38impl Solution {
39    pub fn get_collision_times(cars: Vec<Vec<i32>>) -> Vec<f64> {
40        vec![]
41    }
42}
43
44// submission codes end
45
46#[cfg(test)]
47mod tests {
48    use super::*;
49
50    #[test]
51    fn test_1776() {
52    }
53}
54


Back
© 2025 bowen.ge All Rights Reserved.