背包问题是计算机科学里的经典问题。在最简单的形式中，包括试图将不同重量的数据项放到 * 背包中．以使背包最后达到指定的总重量。不需要把所有的选项都放入背包中-Knapsack problem in computer science in the classic problems. In the simplest form, including different weights in an attempt to put data item* backpack. In order to reach the specified backpack final total weight. Do not need to put all the options are Add backpack