最低加油次数

// Java Stream Solution
// 思路：
// 使用流式编程来实现同样的逻辑，使用 Stream API 和 Lambda 表达式来简化代码。

import java.util.*;
import java.util.stream.Collectors;

public class SolutionStream {
    public int minRefuelStops(int target, int startFuel, int[][] stations) {
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());
        int currentFuel = startFuel;
        int stops = 0;
        int[] index = {0};

        List<int[]> stationList = Arrays.stream(stations).collect(Collectors.toList());

        while (currentFuel < target) {
            stationList.stream()
                .filter(station -> station[0] <= currentFuel)
                .filter(station -> index[0]++ < stations.length)
                .forEach(station -> pq.offer(station[1]));

            if (pq.isEmpty()) return -1;
            currentFuel += pq.poll();
            stops++;
        }
        return stops;
    }
}