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.

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

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