Let's test it in all possible combinations of x and y and see if we get the right answer.

来测试并看看,返回的结果正确不正确。

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

So he's packing and unpacking, packing and unpacking, trying all possible combinations of objects that will obey the constraint. And then choosing the winner. Well, this is like an algorithm we've seen before. It's not greedy.

因此它不断装包和清包,尝试了所有满足约束条件的物品组合,最后选择最优者,这很像我们以前看过的一个算法,这不是贪婪算法。

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