Let's now go back and instantiate these ideas for the knapsack problem we looked at last time In particular, for the 0-1 knapsack problem.

让我们回来用具体例子,来说明我们上次看过的背包问题,特别是对0-1背包问题来说。

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

Last time I showed you his second book and its cover, North of Boston.

上次我让你们看过了他的第二本书和它的封面，波士顿北部。

耶鲁公开课 - 现代诗歌课程节选

Remember, we saw that last time looking at the binary numbers. 2 to the n is a big number.

还记得吗，我们上次看过的二进制数,从2到n是一个很大的数。

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

Now, what we saw last time is there's a brute force solution.

现在，我们上次,看过穷举法解决方案。

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