leetcode

0 class Solution {

1 public:

2 int minPathSum(vector<vector<int>> &grid) {

3 int n = grid.size(), m = grid[0].size();

4

5 for (int i = 1; i < n; i++)

6 grid[i][0] += grid[i - 1][0];

7 for (int j = 1; j < m; j++)

8 grid[0][j] += grid[0][j - 1];

9

10 for (int i = 1; i < n; i++) {

11 for (int j = 1; j < m; j++) {

12 grid[i][j] += min(grid[i - 1][j], grid[i][j - 1]);

13 }

14 }

15

16 return grid[n - 1][m - 1];

17 }

18 };