if remaining >= 0 and m[remaining] + values[i] > best then
best = m[remaining] + values[i]
m[j] = best
return m[W]
❶
m
[
i
][
j
]
记录的是考虑
i
个物品而且不超过质量
w
时能够获得的最大价值。
❷
能否通过将之前的将第
i
-
1
号物品加入背包呢?
❸
第
i
-
1
号物品超过了质量限制,所以不能改进解决方案。
❹
返回计算出的最佳结果。
❺
对于无限背包问题来说,
m
[
j
]
记录的是不超过质量
j
的最大物品价值。
11.2.1 输入/ 输出
给定一系列物品(每件物品都有一个整数值的质量和价值) ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.