class Solution {
public int maxValue(int[][] grid) {
int[][] dp=new int[grid.length][grid[0].length];
dp[0][0]=grid[0][0];
for(int i=0;i<grid.length;i++)
{
for(int j=0;j<grid.length;j++)
{ int a,b;
a=(i-1)>=0?dp[i-1][j]:0;
b=(j-1>=0)?dp[i][j-1]:0;
dp[i][j]=Math.max(a,b)+grid[i][j];
}
}
return dp[grid.length-1][grid[0].length-1];
}
}
03-22
247
03-08
391