(Leetcode)64. Minimum Path Sum(medium)

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
Note: You can only move either down or right at any point in time.

这道题用动态规划做的话和博客上另外一道在m*n上的格子移动的方案那题非常类似，只不过初始化的方式以及动态规划的表达式有点不一样。同样是用二维数组来存储每一个位置的最有移动路径的值，与子问题的表达式为
sum[I][j]=grid[I][j]+min{sum[I-1][j],sum[I][j-1]}

我的答案：

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