预测每一种可能的驾驶情况是一个困难的编程问题。
To anticipate every imaginable driving situation is a difficult programming problem.
因为这并不是一个编程问题。
在第一个示例中,我们将处理下述的编程问题。
For the first example, we will take the following programming problem.
Now, when we talked about optimization problems in dynamic programming, I said there were two things to look for.
现在,当我们讨论,动态编程中的最优化问题时,我想说有两件事需要注意。
And when you have an optimal substructure and the local solutions overlap, that's when you can bring dynamic programming to bear.
当你得到一个最优子结构,但局部解决方案有重跌时,你就可以引入动态编程,来解决这个问题了。
That are not readily dealt with in a prograing problem. It also deals with issues of some of the subtleties of things like aliasing.
它还和一些很细微的问题,比如重名等有关系,因此这不关编程的事儿。
应用推荐