Why this problem can be solved in Greedy? Why not 0/1 Knapsack Problem?

  • 0

    My first thought is that this problem should be solved using DP 0/1? Why it can simply using the Greedy?

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.