mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 21:10:58 +08:00
格式
This commit is contained in:
@ -459,7 +459,7 @@ func main() {
|
||||
// dp数组, dp[i][j]代表行李箱空间为j的情况下,从下标为[0, i]的物品里面任意取,能达到的最大价值
|
||||
dp := make([][]int, n)
|
||||
for i := range dp {
|
||||
dp[i] = make([]int, bagweight+1)
|
||||
dp[i] = make([]int, bagweight + 1)
|
||||
}
|
||||
|
||||
// 初始化, 因为需要用到dp[i - 1]的值
|
||||
|
Reference in New Issue
Block a user