（背包二）完全背包

public class BeibaoComplete {
    public static void main(String[] args) {

        //int[] value = { 48, 40, 12, 8, 7 };
        //int[] weight = { 6, 5, 2, 1, 1 };
        //int capacity = 8;
        int[] value = {10,40,30,50};
        int[] weight = {5,4,6,3};
        int capacity =12;

        int result = packageComplete(value, weight, capacity);
        System.out.println(result);

    }

    public static int packageComplete(int[] value, int[] weight, int capacity) {
        int length = value.length;
        int[][] dp = new int[length + 1][capacity + 1];
        for (int column = 0; column <= capacity; column++) {
            dp[0][column] = 0;
        }
        for (int row = 0; row <= length; row++) {
            dp[row][0] = 0;
        }

        for (int row = 1; row <= length; row++) {
            for (int column = 1; column <= capacity; column++) {

                for (int k = 0; k * weight[row-1] <= column; k++) {             
                    dp[row][column] = Math.max(dp[row][column], dp[row - 1][column - k * weight[row-1]] + k * value[row-1]);
                }           

            }
        }
        /*
         * 上述第三层for的解释：在填第raw行，第col列时，可能会一直装raw行的物品
         * */

        return dp[length][capacity];
    }


}

//运行结果：
200
//说明：上述代码只给出了总个数，没有给出具体路径。