【2021秋冬】【剑指offer】47. 礼物的最大价值

我会写动规了？我感觉我好像行了

class Solution {
    public int maxValue(int[][] grid) {
        if(grid.length == 0 || grid[0].length == 0) return 0;
        int maxg = grid[0][0];
        int[][] f = new int[grid.length][grid[0].length];
        f[0][0] = grid[0][0];
        for(int i=0; i<grid.length; i++)
            for(int j=0; j<grid[0].length; j++){
                if(i==0&&j==0) continue;
                if(i-1<0) f[i][j] = f[i][j-1] + grid[i][j];
                else if(j-1<0) f[i][j] = f[i-1][j] + grid[i][j];
                else f[i][j] =  Math.max(f[i-1][j],f[i][j-1]) + grid[i][j];
                //System.out.println("i " + i + " j " + j + " f " + f[i][j]);
                maxg = Math.max(maxg,f[i][j]);
            }
        return maxg;
    }
}