枚举_01背包

package agrisom;
/**
 * 枚举法解01背包问题
 */
public class BackPack01Enumeration {
    public int [] weights; //背包重量数组
    public int [] values;  //背包价值数组
   
    public BackPack01Enumeration(int [] weights,int [] values){
        this.weights=weights;
        this.values=values;
    }
    /**
     * 十进制数到二进制数据的转换
     */
    public int [] transform(int n,int length){
        int [] binary=new int [length];
        for(int i=0;i<length;i++){
            binary[i]= n%2;
            n = n/2;
            if(n==0){
                break;   
            }
        }
        return binary;
    }
    /**
     * 对2的n次方中组合进行枚举
     */
    public void enumerate(int maxWeight){
        int length=this.weights.length;
        int maxValue=0;       //背包最大价值
        int [] status=null;   //物品选择数组
        for(int i=0;i<Math.pow(2, length);i++){
            int tempWeight=0; //背包临时最大重量
            int tempValue=0;  //背包临时最大价值
            int [] solution=this.transform(i,length);
            for(int j=0;j<length;j++){
                if(solution[j] ==1){
                    tempWeight+=this.weights[j];
                    tempValue+=this.values[j];
                }
            }
            if(tempWeight<maxWeight && tempValue>maxValue){
                maxValue=tempValue;
                status=solution;
            }
           
        }
        System.out.println("the greatest value is: "+maxValue);
        System.out.print("select method is: ");
        for(int i=0;i<status.length;i++){
            System.out.print(status[i]+" ");
        }
    }
   
    public static void main(String [] args){
        int [] weights=new int[]{35,30,60,50,40,10,25};
        int [] values=new int[]{10,40,30,50,35,40,30};
       
        BackPack01Enumeration bpe=new BackPack01Enumeration(weights,values);
        bpe.enumerate(150);
    }
}
/**
运行结果：
the greatest value is: 165
select method is: 0 1 0 1 1 1 0
*/package agrisom;
/**
 * 枚举法解01背包问题
 */
public class BackPack01Enumeration {
    public int [] weights; //背包重量数组
    public int [] values;  //背包价值数组
   
    public BackPack01Enumeration(int [] weights,int [] values){
        this.weights=weights;
        this.values=values;
    }
    /**
     * 十进制数到二进制数据的转换
     */
    public int [] transform(int n,int length){
        int [] binary=new int [length];
        for(int i=0;i<length;i++){
            binary[i]= n%2;
            n = n/2;
            if(n==0){
                break;   
            }
        }
        return binary;
    }
    /**
     * 对2的n次方中组合进行枚举
     */
    public void enumerate(int maxWeight){
        int length=this.weights.length;
        int maxValue=0;       //背包最大价值
        int [] status=null;   //物品选择数组
        for(int i=0;i<Math.pow(2, length);i++){
            int tempWeight=0; //背包临时最大重量
            int tempValue=0;  //背包临时最大价值
            int [] solution=this.transform(i,length);
            for(int j=0;j<length;j++){
                if(solution[j] ==1){
                    tempWeight+=this.weights[j];
                    tempValue+=this.values[j];
                }
            }
            if(tempWeight<maxWeight && tempValue>maxValue)

补充：综合编程 , 其他综合 ,