题解 | #矩阵的最小路径和#

class Solution {
public:
    /**
     * 
     * @param matrix int整型vector<vector<>> the matrix
     * @return int整型
     */
    int minPathSum(vector<vector<int> >& matrix) {
        // write code here
        int len1 = matrix.size();
        int len2 = matrix[0].size();
        vector<vector<int>>dp(len1,vector<int>(len2,0));
        int i = 1,j = 1;
        dp[0][0] = matrix[0][0];
        while(i<len1&&j<len2)
        {
            dp[i][0] = matrix[i][0]+dp[i-1][0];
            dp[0][j] = matrix[0][j]+dp[0][j-1];
            i++;j++;
        }
        for(int i= 1;i < len1 ; i++)
        {
            for(int j = 1;j < len2; j++)
            {
                if(dp[i-1][j]<dp[i][j-1])
                {
                    dp[i][j] = dp[i-1][j]+matrix[i][j];
                }
                else 
                {
                    dp[i][j] = dp[i][j-1]+matrix[i][j];
                }
            }
        }
        return dp[len1-1][len2-1];
    }
};