贪心算法JAVA实现代码.docx

文档介绍：贪心算法背包问题java代码packagetxsf;.*;lassBag{ publicintgetCapacity(){ returncapacity; } publicvoidsetCapacity(intcapacity){ =capacity; } publicfloatgetValue(){ returnvalue; } publicvoidsetValue(floatvalue){ =value+; } privateintcapacity;//背包容量 privatefloatvalue;//背包内价值 privateRandomrand; publicBag(){//自动生成背包 rand=newRandom(); capacity=(150); if(capacity<50){ capacity+=(70); } ("背包容量:"+capacity); value=0; } publicBag(intcapacity){//手工生成背包 =capacity; ("背包容量:"+capacity); } publicfloatgetvalue(){ returnvalue; }}/*puteItems{ publicList<Items>list=newArrayList<Items>(); //public}*/classItems{ privateStringimageStr;//物品名称 privateintcapacity;//物品空间 privateintvalue;//物品价值 privateRandomrand; publicItems(Strings){//自动生成物品 rand=newRandom(); =s; =(50)+1; =(50)+1; (s+":"++""+); } publicItems(Strings,intcapacity,intvalue){//手工生成物品 =s; =capacity; =value; } publicfloatgetCapacity(){ ; } publicfloatgetValue(){ ; } publicStringgetimageStr(){ ; } publicStringtoString(){ return""+imageStr+":容量为:"+capacity+"价值为:"+value; }}pute{ float[]Sort(); MapgetMap(); }//pute{ privateList<Items>list; privatefloat[]array;//排序物品权值 privateMap<Float,Items>mapItems;//哈希表,用来存放物品权值与物品 apa(Listlist){ =list; mapItems=newHashMap<Float,Items>(); array=newfloat[()]; } publicfloat[]Sort(){ inti=0; for(Itemsitems:list){ array[i++]=();//将物品权重放入数组 ((),items);//将物品权重与物品对象放入map对象} (array);//物品排序升序 returnarray; } ***@Override publicMapgetMap(){ //TODOAuto-generatedmethodstub returnmapItems; } publicStringtoString(){ return"重量优先"; }}//pute{ privateList<Items>list; privatefloat[]array; privateMap<Float,Items>mapItems; publicValue(Listlist){ =l