/
greedy.rs
59 lines (47 loc) · 1.71 KB
/
greedy.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
pub struct Solution;
// ------------------------------------------------------ snip ------------------------------------------------------ //
use std::collections::BinaryHeap;
use std::convert::TryInto;
impl Solution {
pub fn min_refuel_stops(target: i32, start_fuel: i32, stations: Vec<Vec<i32>>) -> i32 {
let mut passed_stations = BinaryHeap::<i32>::new();
let mut prev_position = 0;
let mut prev_fuel = start_fuel;
for station in &stations {
let [position, fuel]: [_; 2] = station.as_slice().try_into().unwrap();
let fuel_required = position - prev_position;
while prev_fuel < fuel_required {
if let Some(fuel) = passed_stations.pop() {
prev_fuel += fuel;
} else {
return -1;
}
}
passed_stations.push(fuel);
prev_position = position;
prev_fuel -= fuel_required;
}
let fuel_required = target - prev_position;
while prev_fuel < fuel_required {
if let Some(fuel) = passed_stations.pop() {
prev_fuel += fuel;
} else {
return -1;
}
}
(stations.len() - passed_stations.len()) as _
}
}
// ------------------------------------------------------ snip ------------------------------------------------------ //
impl super::Solution for Solution {
fn min_refuel_stops(target: i32, start_fuel: i32, stations: Vec<Vec<i32>>) -> i32 {
Self::min_refuel_stops(target, start_fuel, stations)
}
}
#[cfg(test)]
mod tests {
#[test]
fn test_solution() {
super::super::tests::run::<super::Solution>();
}
}