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.
和去年京东的一道笔试题非常类似,经典的动态规划问题。
代码:
class Solution {
public:
int minPathSum(vector<vector<int> > &grid) {
int m = grid.size();
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];
}
};