Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.
// Source : https://oj.leetcode.com/problems/minimum-path-sum/
// Author : Chao Zeng
// Date : 2015-1-27
class Solution {
public:
int minPathSum(vector<vector<int> > &grid) {
int m = grid.size();
int n = grid[0].size();
if (m == 0 || n == 0)
return 0;
vector<vector<int> >MinSum(m+1,vector<int>(n+1));
MinSum[0][0] = grid[0][0];
for (int i = 1; i < n; i++)
MinSum[0][i] = MinSum[0][i-1] + grid[0][i];
for (int j = 1; j < m; j++)
MinSum[j][0] = MinSum[j-1][0] + grid[j][0];
for (int i = 1; i < m; i++){
for (int j = 1; j < n; j++){
MinSum[i][j] = min(MinSum[i-1][j],MinSum[i][j-1]) + grid[i][j];//基本的动态规划
}
}
return MinSum[m-1][n-1];
}
};