CC86带权值的最小路径和C++

链接：

https://www.nowcoder.com/practice/23462ed010024fcabb7dbd3df57c715e?tpId=46&tqId=29115&tPage=1&rp=1&ru=/ta/leetcode&qru=/ta/leetcode/question-ranking

描述和示例：

代码：

class Solution {
public:
    /**
     * 
     * @param grid int整型vector<vector<>> 
     * @return int整型
     */
    int minPathSum(vector<vector<int> >& grid) {
        // write code here
        int row = grid.size();
        int col = grid[0].size();
        
        for(int i = 0;i<row;++i){
            for(int j = 0;j<col;++j)
            {
                if(i == 0 && j == 0) grid[0][0] = grid[0][0];
                else if(i == 0) grid[0][j] = grid[0][j] + grid[0][j-1];
                else if(j == 0) grid[i][0] = grid[i][0] + grid[i-1][0];
                else grid[i][j] = min(grid[i][j-1],grid[i-1][j])+grid[i][j];
            }
        }
        return grid[row-1][col-1];
    }
};