@@ -0,0 +1,692 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/path-with-minimum-effort/%0A */%0Apublic class Problem1631 %7B%0A    public int minimumEffortPath(int%5B%5D%5B%5D heights) %7B%0A        // TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem1631 prob = new Problem1631();%0A        System.out.println(prob.minimumEffortPath(new int%5B%5D%5B%5D%7B%0A            %7B1,2,2%7D,%7B3,8,2%7D,%7B5,3,5%7D%0A        %7D)); // 2%0A        System.out.println(prob.minimumEffortPath(new int%5B%5D%5B%5D%7B%0A            %7B1,2,3%7D,%7B3,8,4%7D,%7B5,3,5%7D%0A        %7D)); // 1%0A        System.out.println(prob.minimumEffortPath(new int%5B%5D%5B%5D%7B%0A            %7B1,2,1,1,1%7D,%7B1,2,1,2,1%7D,%7B1,2,1,2,1%7D,%7B1,2,1,2,1%7D,%7B1,1,1,2,1%7D%0A        %7D)); // 0%0A    %7D%0A%7D%0A

Solve problem 1631