1
class Solution {
2
public:
3
    int minPathSum(vector<vector<int>>& grid) {
4
        if(size(grid) == 1){
5
            int add = 0;
6
            for(auto i : grid[0]) add += i;
7
            return add;
8
        }
9
    //特殊处理
10
        for(int i = 1;i<size(grid);i++){
11
            grid[i][0] += grid[i-1][0];
12
        }
13
        for(int i = 1;i<size(grid[0]);i++){
14
            grid[0][i] += grid[0][i-1];
15
        }
16
    //对gird的第1行、列进行初始化
17
        for(int i = 1;i < size(grid);i++){
18
            for(int j = 1;j < size(grid[0]);j++){
19
                grid[i][j] += min(grid[i-1][j],grid[i][j-1]);
20
        //每格最小花费 += min(上一格最小花费，左一格最小花费)
21
            }
22
        }
23
        return grid[size(grid) - 1][size(grid[0]) - 1];
24
    }
25
};