algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 12:15:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

格式

Browse Source
This commit is contained in:
markwang
2024-08-09 15:05:17 +08:00
parent 93c206794b
commit bb2803ce96
2 changed files with 65 additions and 65 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/背包理论基础01背包-1.md
View File

@ -459,7 +459,7 @@ func main() {
// dp数组, dp[i][j]代表行李箱空间为j的情况下,从下标为[0, i]的物品里面任意取,能达到的最大价值 // dp数组, dp[i][j]代表行李箱空间为j的情况下,从下标为[0, i]的物品里面任意取,能达到的最大价值
dp := make([][]int, n) dp := make([][]int, n)
for i := range dp { for i := range dp {
dp[i] = make([]int, bagweight+1) dp[i] = make([]int, bagweight + 1)
} }
// 初始化, 因为需要用到dp[i - 1]的值 // 初始化, 因为需要用到dp[i - 1]的值