Requirements backpack must be filled with problems

1. Backpack required to be filled and selecting the maximum value

    The memory array initialization dp [0] = 0, the remainder is negative infinity.

2, the backpack to be required for the minimum and filled

     The memory array initialization dp [0] = 0, the remainder is positive infinity.

Guess you like

Origin www.cnblogs.com/zzwbo/p/11277599.html