LeetCode Shopping Offers

原题链接在这里：https://leetcode.com/problems/shopping-offers/description/

题目：

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.

题解：

DFS needs尝试减去special offer的供应量, 如果剩余item需求不为负, 则继续recursive call. 之后backtracking时再加回来.

最后剩余的不能再减掉special offer的部分会在下层recursive call的nonOffer部分计算出来.

Time Complexity: O(special.size()*needs.size()*n), n 是recursive call的层数, 可以是needs中所有integer最大的值.

Space: O(n).

AC Java:

 1 class Solution {
 2     public int shoppingOffers(List<Integer> price, List<List<Integer>> special, List<Integer> needs) {
 3         int res = Integer.MAX_VALUE;
 4         
 5         // dfs, 挨个试offer从needs中减，然后backtracking时加回来
 6         for(List<Integer> offer : special){
 7             // 标记这个offer是否是能减掉的
 8             boolean valid = true;
 9             
10             for(int i = 0; i<needs.size(); i++){
11                 int remain = needs.get(i) - offer.get(i);
12                 needs.set(i, remain);
13                 
14                 if(remain<0){
15                     // 当remain 小于0 说明offer的该item count大于needs的该item count
16                     valid = false;
17                 }
18             }
19             
20             if(valid){
21                 res = Math.min(res, offer.get(offer.size()-1) + shoppingOffers(price, special, needs));
22             }
23             
24             // 加回来
25             for(int i = 0; i<needs.size(); i++){
26                 int origin = needs.get(i) + offer.get(i);
27                 needs.set(i, origin);
28             }
29         }
30         
31         // 不用offer的价钱, 也是上层dfs call最后剩余的那几个item 不能用offer来提供的 
32         int nonOffer = 0;
33         for(int i = 0; i<needs.size(); i++){
34             nonOffer += needs.get(i) * price.get(i);
35         }
36         return Math.min(nonOffer, res);
37     }
38 }

 

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/7606466.html