The notion here is that you can get a globally optimal solution from locally optimal solutions to sub-problems.

这里的概念是你可以通过,子问题的局部最优方案,得到全局优化解决方案。

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

We're exhausting all possibilities. And then choosing the winner. Well, that's what the slow thief tried. Unfortunately it took so long that before he finished the owner returned home, called the police and the thief ended up in jail.

我们穷举了所有可能方案,然后选择最优方案,这就是动作慢的贼的方案,不幸的是它在失主回家之前，要花上了太长的时间。

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

Optimal sub structure.

简单一点的子问题的最优方案来解决问题。

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