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

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param matrix int整型vector<vector<>> the matrix
     * @return int整型
     */
    int minPathSum(vector<vector<int> >& matrix) {
        // write code here
        int n, m;
        n = matrix.size();
        m = matrix[0].size();
        vector<vector<int>>dp(n, vector<int>(m, 0));
        dp[0][0] = matrix[0][0];
        for(int i = 1; i < n; i++)
        dp[i][0] = matrix[i][0] + dp[i-1][0];
        for(int j = 1; j < m; j++)
        dp[0][j] = matrix[0][j] + dp[0][j-1];

        for(int i = 1; i < n; i++)
        {
            for(int j = 1; j < m; j++)
            {
                dp[i][j] = min(dp[i-1][j] + matrix[i][j], dp[i][j-1] + matrix[i][j]);
            }
        }

        return dp[n-1][m-1];
    }
};