解决0/1背包问题 ： 给定一定容量的一个背包，要求放入的货物价值最大（每个货物有固定的容量和价值）-Solve the 0/1 knapsack problem: given a knapsack of a certain capacity, the requirements placed the greatest value of the goods (one for each cargo capacity and a fixed value)