@@ -0,0 +1,651 @@
+/**%0A * Problem Link: https://leetcode.com/problems/minimum-path-sum/%0A * %0A * Dynamic Programming.%0A */%0Apublic class Solution %7B%0A    public int minPathSum(int%5B%5D%5B%5D grid) %7B%0A        int m = grid.length;%0A        int n = grid%5B0%5D.length;%0A        int%5B%5D%5B%5D cost = new int%5Bm%5D%5Bn%5D;%0A        for(int i=0; i%3Cm; i++) %7B%0A            for(int j=0; j%3Cn; j++) %7B%0A                int c = Integer.MAX_VALUE;%0A                if(i %3E 0) c = Math.min(c, cost%5Bi-1%5D%5Bj%5D);%0A                if(j %3E 0) c = Math.min(c, cost%5Bi%5D%5Bj-1%5D);%0A                if(c == Integer.MAX_VALUE) c = 0;%0A                cost%5Bi%5D%5Bj%5D = grid%5Bi%5D%5Bj%5D + c;%0A            %7D%0A        %7D%0A        return cost%5Bm-1%5D%5Bn-1%5D;%0A    %7D%0A%7D%0A

Create Minimum_Path_Sum.java