题目:Minimum Path Sum
原题链接:https://leetcode.com/problems/minimum-path-sum/
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.
给出m * n 的方格,填满了非负整数,找出从左上角到右下角最小的路径和。
注意:只能向右或者向下走。
设dp[ n ],遍历到每一行的dp[ i ]表示当当前行的第 i 格所用的最小花费。
第一行时dp[ i ] 等于dp[ i - 1] + grid[ 0 ][ i ](dp[ 0 ] = grid[ 0 ][ 0 ])。
以后每一行时dp[ 0 ] = dp[ 0 ] + grid[ row ] [ 0 ],其余dp[ i ] = min( dp[ i - 1], dp[ i ] ) + grid[ row ][ i ]
一直遍历到最后一行结束,此时的dp[ col - 1]就是最终的值。
代码如下:
class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int row = grid.size();
if(!row) return 0;
int col = grid[0].size();
int dp[col];
for(int i = 0; i < col; ++i) {
if(!i) dp[i] = grid[0][i];
else dp[i] = dp[i - 1] + grid[0][i];
}
for(int i = 1; i < row; ++i) {
for(int j = 0; j < col; ++j) {
if(!j) dp[j] += grid[i][j];
else dp[j] = min(dp[j - 1], dp[j]) + grid[i][j];
}
}
return dp[col - 1];
}
};