#125 Backpack II

题目描述：

Given n items with size Ai and value Vi, and a backpack with size m. What's the maximum value can you put into the backpack?

 Notice

You cannot divide item into small pieces and the total size of items you choose should smaller or equal to m.

Have you met this question in a real interview? 

Yes

Example

Given 4 items with size [2, 3, 5, 7] and value [1, 5, 2, 4], and a backpack with size 10. The maximum value is 9.

Challenge 

O(n x m) memory is acceptable, can you do it in O(m) memory?

题目思路：

这题和#92一样是背包问题，只是增加了一个价值属性。一样是遍历体积1~m和遍历A，对于体积k，如果想装下A[i]，那么需要满足k >= A[i]，这样，k的价值dp[k]就是装下A[i]之前的价值dp[k - A[i]]加上A[i]的价值V[i].

Mycode（AC = 28ms）：

class Solution {
public:
    /**
     * @param m: An integer m denotes the size of a backpack
     * @param A & V: Given n items with size A[i] and value V[i]
     * @return: The maximum value
     */
    int backPackII(int m, vector<int> A, vector<int> V) {
        // write your code here
        if (A.size() == 0 || m == 0) {
            return 0;
        }
        
        vector<int> dp(m + 1, 0);
        
        for (int i = 0; i < A.size(); i++) {
            for (int k = m; k >= 0; k--) {
                // for size k, if can load size A[i], then 
                // the value is the value of dp[k - A[i]] + A[i]'s value
                if (k - A[i] >= 0) {
                    dp[k] = max(dp[k], dp[k - A[i]] + V[i]);
                }
            }
        }
        
        return dp[m];
    }
};