完全背包 §

public int completedPackage(int capacity, int[] masses
        , int[] values) {
    int len = masses.length;
    int[] dpArr = new int[capacity + 1];
    for (int i = 0; i < len; i++) {
        for (int j = capacity; j > masses[i]; j--) {
            for (int k = 0; j >= masses[i] * k; k++) {
                dpArr[j] = Math.max(dpArr[j]
                    , dpArr[j - masses[i] * k] + values[i] * k);
            }
        }
    }
    return dpArr[capacity];
}