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.

Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

---

左上角走到右下角，求最小路径和。

方法1：动态规划，初始化：最左边和上边一行每个位置最小值为前一个节点最小值加上本身。每个位置最小值为左边位置和上边位置的最小值，加上本身。

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