leetcode每日一题第八十七天

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

    }
};