Now, when we talked about optimization problems in dynamic programming, I said there were two things to look for.

现在，当我们讨论,动态编程中的最优化问题时，我想说有两件事需要注意。

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

So let's look at an example of a zero-one knapsack problem.

我们要像之前一样将其最优化,现在让我们来看一个0/1背包问题的例子。

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