Skip to content

Update 24.回溯算法.md #80

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
reveriezhu wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update 24.回溯算法.md #80

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 0 additions & 1 deletion docs/24.回溯算法.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -173,7 +173,6 @@ def f(i: int, cw: int, items: list, w: int):
if cw == w or i == len(items): # cw==w 表示装满了 ;i==n 表示已经考察完所有的物品
if cw > max_w: max_w = cw
return
f(i + 1, cw, items, w)
if cw + items[i] <= w: # 已经超过可以背包承受的重量的时候，就不要再装了
f(i + 1, cw + items[i], items, w)
```
Expand Down