贪心算法JAVA实现代码.docxVIP

贪心算法背包问题 java 代码 package txsf; import java.util.*; public class Bag { public int getCapacity() { return capacity; } public void setCapacity(int capacity) { this.capacity = capacity; } public float getValue() { return value; } public void setValue(float value) { this.value = value + this.value; } private int capacity;//背包容量 private float value;//背包内价值 private Random rand; public Bag(){//自动生成背包 rand = new Random(); capacity = rand.nextInt(150); if(capacity 50){ capacity += rand.nextInt(70); } System.out.println(背包容量: +capacity); value = 0; } public Bag(int capacity){//手工生成背包 this.capacity = capacity; System.out.println(背包容量: +capacity); } public float getvalue(){ return value; } } /*abstract class ComputeItems{ public ListItems list = new ArrayListItems(); //public }*/ class Items{ private String imageStr;//物品名称 private int capacity;//物品空间 private int value;//物品价值 private Random rand; public Items(String s){//自动生成物品 rand = new Random (); this.imageStr = s; this.value = rand.nextInt(50)+1; this.capacity = rand.nextInt(50)+1; System.out.println(s+: +this.capacity+ +this.value); } public Items(String s,int capacity,int value){//手工生成物品 this.imageStr = s; this.capacity = capacity; this.value = value; } public float getCapacity(){ return this.capacity; } public float getValue(){ return this.value; } public String getimageStr(){ return this.imageStr; } public String toString(){ return +imageStr+: 容量为： +capacity+价值为： +value; } } interface Compute{ float[] Sort(); Map getMap(); } //重量优先计算 class Capa implements Compute{ private ListItems list; private float[] array;//排序物品权值 private MapFloat,Items mapItems ;//哈希表，用来存放物品权值与物品 public Capa(List list){ this.list = list; mapItems = new HashMapFloat,Items(); array = new float[list.size()]; } public float[] Sort(){ int i = 0; for(Items items:list){ array[i++] = items.getCapacity();//将物品权重放入数组 mapItems.put(items.getC