Leetcode 64 Minimum Path Sum

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