题目链接: 剑指 Offer 47. 礼物的最大价值
题目描述:
解法思路:
代码:
// dp[i][j] = max(dp[i][j+1],dp[i+1][j])
func maxValue(grid [][]int) int {
n := len(grid)
if n ==0 {
return 0
}
m := len(grid[0])
dp := make([][]int,n+1)
for i := range dp{
dp[i] = make([]int,m+1)
}
for i:=1;i<=n;i++{
for j:=1;j<=m;j++{
dp[i][j] = max(dp[i][j-1],dp[i-1][j]) + grid[i-1][j-1]
}
}
return dp[n][m]
}
func max(a,b int)int{
if a > b {
return a
}
return b
}