解题思路:
(1)动态规划
class Solution {
public:
/**
*
* @param matrix int整型vector<vector<>> the matrix
* @return int整型
*/
int minPathSum(vector<vector<int> >& matrix) {
int m=matrix.size(),n=matrix[0].size();
vector<vector<int> > dp(m,vector<int>(n,0));
for(int i=0;i<m;i++) {
for(int j=0;j<n;j++) {
if(i-1>=0 && j-1>=0) dp[i][j]=min(dp[i-1][j],dp[i][j-1])+matrix[i][j];
else if(i-1>=0) dp[i][j]=dp[i-1][j]+matrix[i][j];
else if(j-1>=0) dp[i][j]=dp[i][j-1]+matrix[i][j];
else dp[i][j]=matrix[i][j];
}
}
return dp[m-1][n-1];
}
};