leet_64.cpp

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