设有一个背包可以放入的物品重量最重为s，现有n件物品，它们的重量分别为w[0]、 w[1]、w[2]、…、w[n-1]。问能否从这n件物品中选择若干件放入此背包中，使得放入的重量之和正好为s。如果存在一种符合上述要求的选择，则称此背包问题有解（或称其解为真）；否则称此背包问题无解（或称其解为假）。试用递归方法设计求解背包问题的算法。-There is a backpack weight items can be placed the most weight of s, the existing n items, and their respective weights for w [0], w [1], w [2], ..., w [n-1]. Asked whether the items from the n number of pieces of select Add this backpack makes Add the weight of and an opportunity for s. If there is a choice of these requirements, then the knapsack problem solvability (or its solution is true)　otherwise said no solution to this knapsack problem (or its solution to be false). Trial designed recursive algorithm for solving knapsack problem.