[leetcode]638. Shopping Offers

本文介绍了一个算法问题,即如何利用特殊优惠策略购买指定数量的商品,以达到最低价格。该问题包含商品单价、特殊优惠组合及所需购买的数量,通过递归算法实现最优解。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目链接: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.
class Solution {
public:
    int shoppingOffers(vector<int>& price, vector<vector<int>>& special, vector<int>& needs) {
        return shopping(price,special,needs,0);
    }
private:
    int shopping(vector<int>& price,vector<vector<int>>& special,vector<int>& needs,int i)
    {
        if(i==special.size())
            return dot(needs,price);
        vector<int> clone(needs);
        int j=0;
        for(j=0;j<special[i].size()-1;j++)
        {
            int diff=clone[j]-special[i][j];
            if(diff<0)
                break;
            clone[j]=diff;
        }
        if(j==special[i].size()-1)
            return min(special[i][j]+shopping(price,special,clone,i+1),min(special[i][j]+shopping(price,special,clone,i),shopping(price,special,needs,i+1)));
        else
            return shopping(price,special,needs,i+1);
    }

    int dot(vector<int> a,vector<int> b)
    {
        int sum=0;
        for(int i=0;i<a.size();i++)
        {
            sum+=a[i]*b[i];
        }
        return sum;
    }
};

 

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值