01揹包的java實現

package mytest;

public class AAA {
    public static void main(String[] args) {
        int[] volumes= {0,1,3,2,6,2};//體積
        int[] values = {0,2,5,3,10,4};//價值
        final int packagevolume = 12;//揹包體積
        int[][] dp = new int[6][13];
        boolean[][] flags = new boolean[6][13];
        //
        int max = go(volumes,values,12,dp,flags);
        System.out.println(max);
        //
        for(int i=5,k=12;i>0&&k>0;i--) {
            if(flags[i][k]) {
                System.out.println(i+",value:"+values[i]+",volume:"+volumes[i]);
                k = k - volumes[i];
            }
        }
    }

    private static int go(int[] volumes, int[] values,int v,int[][] dp,boolean[][] flags) {
        for(int i=1;i<6;i++) {
            for(int k=1;k<13;k++) {
                dp[i][k] = dp[i-1][k];
                if(volumes[i]<=k) {
                    int temp = dp[i-1][k-volumes[i]]+values[i];
                    if(temp>dp[i][k]) {
                        dp[i][k] = temp;
                        flags[i][k] = true;
                    }
                }
            }
        }
        return dp[5][12];
    }
}