LeetCode Weekly Contest 40(3) - Shopping Offers

638. Shopping Offers
Difficulty: Medium
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.
You are not allowed to buy more items than you want, even if that would lower the overall price.

本题题意大概为给出每个商品的价格，商品组合在一起的价格，给定每个商品要求购买的个数，程序需要返回最低的价格，Note中提到最多只有6种商品，100种商品组合价格，给出的需求中每种商品最多6个，最后购买的商品个数不能超过给定的需求。

这是最基本的搜索算法题，搜索所有可能的组合，求最小购买价格，这里使用深度优先搜索，细节见注释。

class Solution {
public:
    // 用于记录计算过的需求，由于需求的个数不会超过6个，种类不超过6个，所以可以使用一个int数值来表示一个需求组合，如需求[2,3,1,4,2,1]可以表示成2*7e5+3*7e4+1*7e3+4*7e2+2*7e1+1,也就是7进制表示
    unordered_map<int,int> record;
    int f(vector<int>& price, vector<vector<int>>& special, vector<int> restNumbers) {
        int key = 0;
        int sumval = 0;
        int baseline = 0;
        for(int i=0;i<restNumbers.size();i++) {
            sumval += restNumbers[i];
            // baseline为全部使用商品单价来购买
            baseline += restNumbers[i]*price[i];
            key = key*7 + restNumbers[i];
        }
        // 终止条件
        if(sumval==0) return 0;

        // 避免重复搜索
        if(record.find(key) != record.end()) return record[key];

        for(int i=0;i<special.size();i++) {
            vector<int> restNumbers1;
            for(int j=0;j<special[i].size()-1;j++) {
                // 不能超过需求中的购买个数
                if(special[i][j] > restNumbers[j]) {
                    break;
                }
                restNumbers1.push_back(restNumbers[j]-special[i][j]);
            }
            if(restNumbers1.size() == restNumbers.size()) {
                // 递归计算
                baseline = min(baseline, special[i][special[i].size()-1]+f(price, special, restNumbers1));
            }
        }
        record[key] = baseline;
        return baseline;
    }
    int shoppingOffers(vector<int>& price, vector<vector<int>>& special, vector<int>& needs) {
        return f(price, special, needs);
    }
};