leetcode记录64.Minimum Path Sum

leetcode记录64.Minimum Path Sum

√ Accepted
  √ 61/61 cases passed (8 ms)
  √ Your runtime beats 87.31 % of cpp submissions
  √ Your memory usage beats 100 % of cpp submissions (10.3 MB)


class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        for (int i = 1; i < grid.size(); i++)
        {
            grid[i][0] += grid[i-1][0]; 
        }
        for (int i = 1; i < grid[0].size(); i++)
        {
            grid[0][i] += grid[0][i-1];          
        }  
        for (int i = 1; i < grid.size(); i++)
        { 
            for (int j = 1; j < grid[0].size(); j++)
            {
                grid[i][j] = min(grid[i][j-1]+grid[i][j], grid[i-1][j]+grid[i][j]);
            }
            
        } 
        return grid[grid.size()-1][grid[0].size()-1];      
    }
};