64. 最小路径和——动态规划，O(mn)

终于结束了绝望的期末周，停更了一周，现在继续做题。
这道题就是一道很正常的动态规划，背一下模板就好了。

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) { //动态规划
        if (grid.size() == 0 || grid[0].size() == 0) {  //首先排除空集
            return 0;
        }
        int rows = grid.size(), columns = grid[0].size();
        auto dp = vector<vector<int>>(rows, vector<int>(columns));
        dp[0][0] = grid[0][0];
        for(int i = 1; i < rows; i++){  //初始化第一列数据
            dp[i][0] = dp[i - 1][0] + grid[i][0];
        }
        for(int i = 1; i < columns; i++){   //初始化第一行数据
            dp[0][i] = dp[0][i - 1] + grid[0][i];
        }
        for(int i = 1; i < rows; i++){
            for(int j = 1; j < columns; j++){
                dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];    //逐个处理计算最小值
            }
        }
        return dp[rows - 1][columns - 1];
    }
};

Accepted
61/61 cases passed (8 ms)
Your runtime beats 79.27 % of cpp submissions
Your memory usage beats 44.28 % of cpp submissions (9.8 MB)