package leetcode;

/**
 * https://leetcode.com/problems/cheapest-flights-within-k-stops/
 */
public class Problem787 {
    public int findCheapestPrice(int n, int[][] flights, int src, int dst, int K) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem787 prob = new Problem787();
    }
}

@@ -326,16 +326,161 @@
 m787();%0A
+        System.out.println(prob.findCheapestPrice(3, new int%5B%5D%5B%5D%7B%0A            %7B0, 1, 100%7D, %7B1, 2, 100%7D, %7B0, 2, 500%7D%0A        %7D, 0, 2, 1)); // 200%0A
     %7D%0A%7D%0A

Update problem 787