01 knapsack problem to achieve the most simple, can do more in its expansion, I...

代码说明：

01背包问题最简单实现，可在其上做更多的扩展，不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack