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.

注意二维vector的初始化

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