[LeetCode] 最小路径和

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int n = grid.size();//row
        int m = grid[0].size();//col

        vector<vector<int>> mm(n,vector<int>(m,0));
        mm[0][0] = grid[0][0];
        //for(int i = 1;i < n;i++) mm[i][0] = grid[i][0] + mm[i-1][0];
        //for(int j = 1;j < m;j++) mm[0][j] = grid[0][j] + mm[0][j-1];

        for(int i = 0;i < n;i++)
        {
            for(int j = 0;j < m;j++)
            {
                //mm[i][j] = grid[i][j] + min(mm[i-1][j],mm[i][j-1]);
                if(i == 0 && j == 0) continue;
                else if(i == 0) grid[i][j] += grid[i][j-1];
                else if(j == 0) grid[i][j] += grid[i-1][j];
                else 
                    grid[i][j] += + min(grid[i-1][j],grid[i][j-1]);

            }
        }

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