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

Merge pull request #2292 from wngtk/patch-1

Browse Source 
Update 背包理论基础01背包-2.md
This commit is contained in:
程序员Carl
2023-10-10 09:33:38 +08:00
committed by GitHub
parent 2d57993364 a8366adf1c
commit 71477e677b
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -133,7 +133,7 @@ dp[1] = dp[1 - weight[0]] + value[0] = 15
所以从后往前循环，每次取得状态不会和之前取得状态重合，这样每种物品就只取一次了。 所以从后往前循环，每次取得状态不会和之前取得状态重合，这样每种物品就只取一次了。
**那么问题又来了，为什么二维dp数组历的时候不用倒序呢？** **那么问题又来了，为什么二维dp数组遍历的时候不用倒序呢？**
因为对于二维dp，dp[i][j]都是通过上一层即dp[i - 1][j]计算而来，本层的dp[i][j]并不会被覆盖！ 因为对于二维dp，dp[i][j]都是通过上一层即dp[i - 1][j]计算而来，本层的dp[i][j]并不会被覆盖！