Leetcode_787_K站中转内最便宜的航班_最短路

思想就是模拟一个广搜，广搜一次代表走一步，用dp数组保存到某个节点的最短路长度。

import java.util.Arrays;

class Solution {
    public int findCheapestPrice(int n, int[][] flights, int src, int dst, int k) {
        final int INF = 10000 * 101 + 1;
        int[] dp = new int[n];
        Arrays.fill(dp, INF);
        dp[src] = 0;
        int ans = INF;
        for (int i = 1; i <= k + 1; i++) {
            int[] temp = Arrays.copyOf(dp, n);
            Arrays.fill(temp, INF);
            for (int[] flight : flights) {
                temp[flight[1]] = Math.min(temp[flight[1]], dp[flight[0]] + flight[2]);
            }
            dp = temp;
            ans = Math.min(ans, dp[dst]);
        }
        return ans == INF ? -1 : ans;
    }
}