正在加载图片...
贪心法定义 a greedy algorithm always makes the choice that looks best at the moment That is, it makes a locally optimal choice in the hope that this choice will lead to a globally optimal solution 《算法导 论》 贪心法在每一步都做出一个局部最优的 选择,以期在总体上仍然达到最优贪心法定义 „ A greedy algorithm always makes the choice that looks best at the moment. That is , it makes a locally optimal choice in the hope that this choice will lead to a globally optimal solution. --《算法导 论》 „ 贪心法在每一步都做出一个局部最优的 选择,以期在总体上仍然达到最优
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有