Leetcode 64

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int n = grid.size();
        int m = grid[].size();
        vector<vector<int>> map(n,vector<int>(m,));//注意二维vector的初始化写法
        map[][] = grid[][];
        for(int i=;i < n;i++){
            map[i][] = map[i-][] + grid[i][];
        }
        for(int i=;i < m;i++){
            map[][i] = map[][i-] + grid[][i];
        }
        for(int i=;i < n;i++){
            for(int j=;j < m;j++){
                map[i][j] = min(map[i-][j],map[i][j-]) + grid[i][j];
            }
        }
        return map[n-][m-];
    }
};