最小路径和
给定一个只含非负整数的m*n网格,找到一条从左上角到右下角的可以使数字和最小的路径。
注意事项
你在同一时间只能向下或者向右移动一步
看到这个题的时候最先给我的感觉是这个题跟Floyd算法比较类似,然后很快的找到了状态转移方程,dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
但是对于第一行与第一列的元素是比较特殊的,所以需要提前单独计算其路径和。
class Solution {
public:
/*
* @param grid: a list of lists of integers
* @return: An integer, minimizes the sum of all numbers along its path
*/
int min(int a,int b)
{
if(a>b)return b;
return a;
}
int minPathSum(vector<vector<int>> &grid) {
// write your code here
int m=grid.size();
int n=grid[m-1].size();
int dp[m][n];
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];
}
};
public:
/*
* @param grid: a list of lists of integers
* @return: An integer, minimizes the sum of all numbers along its path
*/
int min(int a,int b)
{
if(a>b)return b;
return a;
}
int minPathSum(vector<vector<int>> &grid) {
// write your code here
int m=grid.size();
int n=grid[m-1].size();
int dp[m][n];
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];
}
};