638. Shopping Offers

In LeetCode Store, there are some kinds of items to sell. Each item has a price.

However, there are some special offers, and a special offer consists of one or more different kinds of items with a sale price.

You are given the each item’s price, a set of special offers, and the number we need to buy for each item. The job is to output the lowest price you have to pay for exactly certain items as given, where you could make optimal use of the special offers.

Each special offer is represented in the form of an array, the last number represents the price you need to pay for this special offer, other numbers represents how many specific items you could get if you buy this offer.

You could use any of special offers as many times as you want.

Example 1:

Input: [2,5], [[3,0,5],[1,2,10]], [3,2]
Output: 14
Explanation: 
There are two kinds of items, A and B. Their prices are $2 and $5 respectively. 
In special offer 1, you can pay $5 for 3A and 0B
In special offer 2, you can pay $10 for 1A and 2B. 
You need to buy 3A and 2B, so you may pay $10 for 1A and 2B (special offer #2), and $4 for 2A.

Example 2:

Input: [2,3,4], [[1,1,0,4],[2,2,1,9]], [1,2,1]
Output: 11
Explanation: 
The price of A is $2, and $3 for B, $4 for C. 
You may pay $4 for 1A and 1B, and $9 for 2A ,2B and 1C. 
You need to buy 1A ,2B and 1C, so you may pay $4 for 1A and 1B (special offer #1), and $3 for 1B, $4 for 1C. 
You cannot add more items, though only $9 for 2A ,2B and 1C.

Note:

There are at most 6 kinds of items, 100 special offers.
For each item, you need to buy at most 6 of them.

From:
LeetCode-Algorithm-Dynamic Programming

Hint:

要找出最优的购买方案，假设我们已经决定购买某些offer，那么在剩余需求中找出最优解就是一个子问题。
因此可以以每个offer为起始方案，找出对应剩余需求的最优解，最终找出各起始方案获得的最优解。由于每次都是顺序访问每个优惠政策，那么我们在下一次访问时可以不必访问当前优惠政策前面的政策，
因为先买offer1，再买offer2，与先买offer2， 再买offer1是等价的。这样可以避免大量重复子问题。

class Solution {
public:
    int shoppingOffers(vector<int>& price, vector<vector<int>>& special, vector<int>& needs) {
        vector<int> need = needs;
        return shopping(price,special,need,0);
    }
    int shopping(vector<int>& price, vector<vector<int>>& special, vector<int> needs, int pre_i) {
        int result = INT_MAX;
        for (int i = pre_i; i < special.size(); i++) {
            bool Invalidflag = false;
            for(int j = 0; j < needs.size(); j++) {
                needs[j] -= special[i][j];
                if (needs[j] < 0) {
                    Invalidflag = true;
                }
            }
            if (!Invalidflag) {
                result = min(result,shopping(price,special,needs,i)+special[i].back());
            }
            for(int j = 0; j < needs.size(); j++) {
                needs[j] += special[i][j];
            }
        }
        int nooffercost = 0;
        for (int i = 0; i < needs.size(); i++) {
            nooffercost += price[i]*needs[i];
        }
        return min(result,nooffercost);
    }
};

如果使用动态规划算法，可以把子问题的解存储起来,但在Leetcode上，算法耗时并没有加快

class Solution {
private:
    map<string, int> needLib;
    string intArrayToString(int *need) {
        stringstream ss;
        for (int i = 0; i < 6; i++) {
            ss << need[i] << '&';
        }
        string s;
        ss >> s;
        return s;
    }
    int needSize;
public:
    int shoppingOffers(vector<int>& price, vector<vector<int>>& special, vector<int>& needs) {
        int need[6];
        for (int i = 0; i < 6; i++) need[i] = 0;
        needSize = needs.size();
        for (int i = 0; i < needSize; i++) {
            need[i] = needs[i];
        }
        return shopping(price,special,need,0);
    }
    int shopping(vector<int>& price, vector<vector<int>>& special, int needs[], int pre_i) {
        int result = INT_MAX;
        for (int i = pre_i; i < special.size(); i++) {
            bool Invalidflag = false;
            for(int j = 0; j < needSize; j++) {
                needs[j] -= special[i][j];
                if (needs[j] < 0) {
                    Invalidflag = true;
                }
            }
            if (!Invalidflag) {
                auto search = needLib.find(intArrayToString(needs));
                if (search != needLib.end()) {
                    result = min(result,search->second+special[i].back());
                } else {
                    result = min(result,shopping(price,special,needs,i)+special[i].back());
                }
            }
            for(int j = 0; j < needSize; j++) {
                needs[j] += special[i][j];
            }
        }
        int nooffercost = 0;
        for (int i = 0; i < 6; i++) {
            nooffercost += price[i]*needs[i];
        }
        result = min(result,nooffercost);
        needLib.insert(pair<string, int>(intArrayToString(needs),result));
        return result;
    }
};