贪心选择性质(greedy-choice property )和最优子结构(optimal substructure)是贪心算法的两个关键点。如果一个问题具备以上两种属性,那么就能设计出适合这个问题的贪心算法。
基于64个网页-相关网页
另一件就是最优子结构。
所以让我们问问,这个问题是否有最优子结构。
So let's ask, is there an optimal substructure to this problem.
根据多段图最优子结构性质设计了个体适应度评价函数。
Individual fitness function based on multi-segment map optimal sub-structure was designed.
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.
另一件就是最优子结构。
应用推荐