文件里面的代码主要是用递归算法，动态规划的算法，贪婪算法，回溯算法解决没有利润分配的背包问题。-File inside the code is mainly used recursive algorithm, dynamic programming algorithms, greedy algorithms, backtracking algorithm to solve knapsack problem is no distribution of profits.

很经典的01背包以及分数背包问题的解决方案，分别用了动态规划以及递归的思想！-01Knapsack and fractional Knapsack in java