0-1背包的各种算法解法

[{"title":"（ 5 个子文件 77KB ） 0-1背包的各种算法解法","children":[{"title":"0-1背包问题动态规划，贪心，回溯，分支限界算法的设计与实现","children":[{"title":"BTKnapsack(回溯).java <span style='color:#111;'> 2.56KB </span>","children":null,"spread":false},{"title":"算法分析1.doc <span style='color:#111;'> 159.50KB </span>","children":null,"spread":false},{"title":"Knapsack(动态规划).java <span style='color:#111;'> 2.11KB </span>","children":null,"spread":false},{"title":"Knapsack_tx(贪心).java <span style='color:#111;'> 2.58KB </span>","children":null,"spread":false},{"title":"BBKnapsack(分支限界).java <span style='color:#111;'> 5.36KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]