[Leetcode] 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:

1. There are at most 6 kinds of items, 100 special offers.
2. For each item, you need to buy at most 6 of them.
3. You are not allowed to buy more items than you want, even if that would lower the overall price.

思路：

刚开始想到的是动态规划，可是如果定义dp[i][j][k]...表示第1个物品买i件，第2个物品买j件，第3个物品买k件...，由于物品最多可能高达6件，所以导致dp的状态非常多，所以后来就放弃了。

后来采用DFS + BackTracking似乎可行，不过时间复杂度略高。由于存在某些special offer还可能导致更贵，所以我们在开始的时候给special offer添加几个特殊的项，也就是每个物品都买1件采用原价的情况。最后，就是采用标准的DFS模板求解了。

代码：

class Solution {
public:
    int shoppingOffers(vector<int>& price, vector<vector<int>>& special, vector<int>& needs) {
        min_price = INT_MAX;
        for (int i = 0; i < price.size(); ++i) {
            vector<int> items(price.size(), 0);
            items[i] = 1;
            items.push_back(price[i]);
            special.push_back(items);
        }
        shoppingOffers(price, special, needs, 0, 0);
        return min_price;
    }
private:
    void shoppingOffers(vector<int> &price, vector<vector<int>> &special, vector<int> needs, int total_price, int pos) {
        if (pos == special.size()) {
            for (int i = 0; i < needs.size(); ++i) {
                if (needs[i] > 0) {
                    return;
                }
            }
            min_price = min(min_price, total_price);
            return;
        }
        vector<int> new_needs(needs);
        bool valid = true;
        for(int i = 0; i < new_needs.size(); ++i) {
            new_needs[i] -= special[pos][i];
            if (new_needs[i] < 0) {
                valid = false;
                break;
            }
        }
        // option 1: use this option if valid
        if (valid) {
            shoppingOffers(price, special, new_needs, total_price + special[pos].back(), pos);
        }
        // option 2: do not use this special offer
        shoppingOffers(price, special, needs, total_price, pos + 1);
    }
    int min_price;
};