剑指 Offer 47. 礼物的最大价值

Posted 2021-12-10 小布丁value

class Solution {
    public int maxValue(int[][] gird) {
        int m = gird.length, n = gird[0].length;
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(i==0&&j==0) continue;
                if(i==0&&j!=0) gird[i][j]+=gird[i][j-1];
                if(i!=0&&j==0) gird[i][j]+=gird[i-1][j];
                if(i!=0&&j!=0) gird[i][j]+=Math.max(gird[i-1][j],gird[i][j-1]);
            }
        }
        return gird[m-1][n-1];

    }
}