And when you have an optimal substructure and the local solutions overlap, that's when you can bring dynamic programming to bear.

当你得到一个最优子结构,但局部解决方案有重跌时，你就可以引入动态编程,来解决这个问题了。

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

So let's ask, is there an optimal substructure to this problem.

所以让我们问问，这个问题是否有最优子结构。

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

And the other one was optimal substructure.

另一件就是最优子结构。

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