这个是我的项目,主要是时间比较紧张,所以写得不是很好!碰撞部分用了像素和矩形碰撞!-This is my project, mainly relatively tense time, so writing is not very good! Collision part of the pixels and rectangular with a collision!
该程序用贪心算法来求解0-1背包问题 采用贪婪准则:每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p/w largest goods Add backpack.