解决0-1背包问题的几种方法，有回溯，有优先分支界限，是一个实验报告的格式-0-1 knapsack problem to solve several methods, there are retrospective, have priority branch and bound, the format of a lab report

Implement 0/1 Knapsack problem using dynamic programming

采用动态规划思想解决0-1背包问题，更好的理解动态规划思想，理解递归的理念- It uses dynamic programming to solve the 0-1 knapsack problem, a better understanding of dynamic programming, understanding the concept of recursion