要看到问题的本质，你必须考虑到这是一个组合包的事实。

To see the nature of the problem you've got to think about the fact that it's a combination package.

youdao

使用复合，两个或多个简单的闭包可以组合起来构成一个更复杂的闭包。

Using composition, two or more simple closures can be combined to produce a more elaborate one.

youdao

每个节点使用某个贡献包、某个组合和运行节点的环境的属性(例如主机和端口)进行配置。

Each node is configured using a contribution, a composite, and the properties of the environment, like host and port, where the node is run.

youdao

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.

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

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