問題詳情
( )20.Which of the following statements of Greedy Method(Greedy)/Dynamic Programming(DP) is NOT correct?
(A) Kruskal’s Minimum Spanning Tree(MST), Prim’s MST and Dijkstra’s Shortest Path algorithm are Greedy.
(B) 0/1 knapsack problem is DP, while Fractional Knapsack Problem is Greedy.
(C) Huffman Coding is a kind of DP, while Floyd Warshall Algorithm is Greedy.
(D) Coin Change and Count ways to reach the n’th stair are both DP.
參考答案
答案：C
難度：適中0.583
書單：沒有書單，新增