题解 | #礼物的最大价值#

import java.util.*;

public class Solution { /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param grid int整型二维数组 * @return int整型 */ public int maxValue (int[][] grid) { int len = grid.length; int len1 = grid[0].length; int[][] dp = new int[len][len1]; for(int i = 0;i < len;i++) { for(int j = 0;j < len1;j++) { if(i==0 && j==0) { dp[i][j] = grid[i][j]; continue; } if(i==0) { dp[i][j] = dp[i][j-1] + grid[i][j]; continue; } if(j==0) { dp[i][j] = dp[i-1][j] + grid[i][j]; continue; } dp[i][j] = Math.max(dp[i-1][j], dp[i][j-1]) + grid[i][j]; } }

	return dp[len-1][len1-1];
}

}