Create 64. Minimum Path Sum

Author: stone16

64. Minimum Path Sum

@@ -0,0 +1,23 @@
+public class Solution {
+    public int minPathSum(int[][] grid) {
+        if(grid == null || grid.length == 0 || grid[0].length == 0){
+            return Integer.MAX_VALUE;
+        }
+	  int row = grid.length;
+	  int col  = grid[0].length; 
+	  for (int i = 0; i < row; i++) {
+		  for (int j = 0; j < col; j++) {
+			  if (i == 0 && j != 0) {
+				  grid[i][j] = grid[i][j] + grid[i][j - 1];
+			  } else if (i != 0 && j == 0) {
+				    grid[i][j] = grid[i][j] + grid[i - 1][j];
+			  } else if (i == 0 && j == 0) {
+				  grid[i][j] = grid[i][j];
+			  } else {
+				  grid[i][j] = Math.min(grid[i][j - 1], grid[i - 1][j]) + grid[i][j];
+			  }
+		  }
+	  }
+	  return grid[row - 1][col - 1];
+  }
+}