剑指offer 礼物max价值

 

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