64. Minimum Path Sum

题意：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.

思路：典型的DP问题，一开始想错了，以为可以四个方向都走。。差点用最短路径来做。。用DP的思路就是，第一行和第一列都只能按顺序递增赋值，因为只有一种走法，其他的位置d[i][j] = min(d[i-1][j],d[i][j-1])+grid[i][j]，具体看代码：

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int m = grid.size();
        int n = grid[0].size();
        vector<vector<int>> res(m,vector<int>(n,0));
        res[0][0] = grid[0][0];
        for (int i = 1;i<m;i++)
            res[i][0] = res[i-1][0]+grid[i][0];
        for (int i = 1;i<n;i++)
            res[0][i] = res[0][i-1]+grid[0][i];
        // cout<<res[0][1];
        for (int i = 1;i<m;i++){
            for(int j = 1;j<n;j++){
                res[i][j] = min(res[i-1][j],res[i][j-1])+grid[i][j];
            }
        }
        return res[m-1][n-1];
    }
};