And so you could construct all subsets, check that the weight is less than the weight of the knapsack, and then choose the subset with the maximum value.

因此你可以构建所有子问题，判断它的重量,是否小于背包的重量，然后选择值最大的子问题。

麻省理工公开课 - 计算机科学及编程导论课程节选

So I haven't done magic, I've given you a really fast way to solve a knapsack problem, but it's still exponential deep down in its heart, in something.

所以我并没有施魔法，我已经告诉了你,一种快速解决背包问题的方法了,但是某些方面它的核心仍然是指数增长的。

麻省理工公开课 - 计算机科学及编程导论课程节选

You are an avid backpacker, you've been all of the United States perhaps even broader.

你是个很有野心的背包客，你几乎走遍了全美，甚至更多地方。

普林斯顿公开课 - 人性课程节选

Can you tune in to any number of designs including duffel bags, if you're the athletic type, law bears if you're more of the stuffed animal type, and then under the new category here do we have a whole bunch of meem themes shirt as well.

你们看到设计的任一编号，如果你是运动型的，有这样的背包,如果你更喜欢动物，也有玩具熊，在新的分类下，我们也提供了一系列,米依美主题的T恤。

哈佛公开课 - 计算机科学课程节选

STUDENT: You can't exceed the volume that the knapsack can hold.

学生：你不能超过背包,所能容纳物品的体积。

麻省理工公开课 - 计算机科学及编程导论课程节选