2

kedebug · kedebug · commit dd07bc71f3e1 · 2013-06-30T22:58:21.000+08:00
diff --git a/MinimumPathSum/MinimumPathSum.cpp b/MinimumPathSum/MinimumPathSum.cpp
@@ -0,0 +1,25 @@
+class Solution {
+public:
+    int minPathSum(vector<vector<int>>& grid) {
+        // Start typing your C/C++ solution below
+        // DO NOT write int main() function
+        
+        int m = grid.size();
+        if (m == 0) return 0;
+        int n = grid[0].size();
+        
+        vector<vector<int>> dp(m, vector<int>(n, 0));
+        
+        dp[0][0] = grid[0][0];
+        for (int i = 1; i < m; i++)
+            dp[i][0] = dp[i-1][0] + grid[i][0];
+        for (int j = 1; j < n; j++)
+            dp[0][j] = dp[0][j-1] + grid[0][j];
+        
+        for (int i = 1; i < m; i++) {
+            for (int j = 1; j < n; j++)
+                dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
+        }
+        return dp[m-1][n-1];
+    }
+};
