题解 | #矩阵的最小路径和#
矩阵的最小路径和
http://www.nowcoder.com/practice/7d21b6be4c6b429bb92d219341c4f8bb
class Solution {
public:
/**
*
* @param matrix int整型vector<vector<>> the matrix
* @return int整型
*/
int minPathSum(vector<vector<int> >& matrix) {
int n = matrix.size();
int m = matrix[0].size();
int dp[n][m];
dp[0][0] = matrix[0][0];
for(int i = 1;i < n;i++){
dp[i][0] = dp[i-1][0] + matrix[i][0];
}
for(int i = 1;i < m;i++){
dp[0][i] = dp[0][i-1] + matrix[0][i];
}
for(int i = 1;i < n;i++){
for(int j = 1;j < m;j++){
dp[i][j] = min(dp[i-1][j],dp[i][j-1]) + matrix[i][j];
}
}
return dp[n-1][m-1];
}
};
