K 站中转内最便宜的航班

// Java solution using Java Streams for finding the cheapest flight with at most K stops
// Streams are used to filter and map the flights

import java.util.Arrays;
import java.util.stream.Stream;

public class Solution {
    public int findCheapestPrice(int n, int[][] flights, int src, int dst, int K) {
        // Initialize the distance array with a large value
        int[] dp = new int[n];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[src] = 0;
        
        // Iterate over the number of stops
        for (int i = 0; i <= K; i++) {
            // Make a copy of the current distance array
            int[] temp = Arrays.copyOf(dp, n);
            Stream.of(flights)
                .filter(flight -> dp[flight[0]] != Integer.MAX_VALUE)
                .forEach(flight -> {
                    int u = flight[0], v = flight[1], w = flight[2];
                    temp[v] = Math.min(temp[v], dp[u] + w);
                });
            dp = temp;
        }
        
        // Return the result
        return dp[dst] == Integer.MAX_VALUE ? -1 : dp[dst];
    }
}