完全背包

//完全背包
public static int knapCom(int[] wei, int[] val, int n, int C) {
    int[] V = new int[C+1];
    for (int i = 1; i <= n; i++) {
        for(int j = wei[i-1]; j <= C; j++) {
            V[j] = Math.max(V[j], V[j-wei[i-1]] + val[i-1]);
        }
    }
    return V[C];
}

参考：https://www.cnblogs.com/fengziwei/p/7750849.html