Create Minimum Path Sum

Author: HarryWangATX

Minimum Path Sum

@@ -0,0 +1,20 @@
+class Solution {
+    public int minPathSum(int[][] grid) {
+        int[][] dp = new int[grid.length][grid[0].length];
+        for(int i = 0; i<grid.length; i++){
+            for(int j = 0; j<grid[i].length; j++){
+                dp[i][j] += grid[i][j];
+                if(j > 0 && i>0){
+                    dp[i][j] += Math.min(dp[i-1][j] , dp[i][j-1]);
+                }
+                else if(j>0){
+                    dp[i][j] += dp[i][j-1];
+                }
+                else if(i > 0){
+                    dp[i][j] += dp[i-1][j];
+                }
+            }
+        }
+        return dp[dp.length-1][dp[0].length-1];
+    }
+}