zoukankan      html  css  js  c++  java
  • 【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.

    解题思路:题目约定中最多只有六种物品,而且够买的时候每种物品都只能等于要求的数量。所以直接用DFS吧。

    代码如下:

    class Solution(object):
        def shoppingOffers(self, price, special, needs):
            """
            :type price: List[int]
            :type special: List[List[int]]
            :type needs: List[int]
            :rtype: int
            """
            if sum(needs) == 0: return 0
            queue = []
            for i in range(len(price)):
                tl = [0] * (i) + [1] + [0] * (len(price) -i - 1) + [price[i]]
                special.append(tl)
            for i in range(len(special)):
                queue.append((special[i][:-1],special[i][-1],i))
    
            res = float('inf')
            while len(queue) > 0:
                buy,total_price,inx = queue.pop(0)
                if total_price >= res:
                    continue
                elif buy == needs and (res > total_price):
                    res = total_price
                for i in range(inx,len(special)):
                    flag = True
                    for j in range(len(buy)):
                        if buy[j] + special[i][j] > needs[j]:
                            flag = False
                            break
                    if flag:
                        tl = []
                        for j in range(len(buy)):
                            #buy[j] += special[i][j]
                            tl.append(buy[j] + special[i][j])
                        queue.insert(0, (tl,total_price + special[i][-1],i))
            return res
            
  • 相关阅读:
    LED自动同步时钟(LED电子时钟系统)京准电子
    电力北斗对时装置(北斗时钟同步系统)详细介绍
    京准时间同步系统(NTP网络同步时钟)概述
    京准:NTP时钟服务器(NTP时钟服务器)研究分析
    医院时钟系统(子母钟系统)设计组成架构
    GPS校时器(北斗授时设备)助力政务云建设
    三大免费开源的php语言cms系统 用好它们让你一天建好一个网站
    想精通正则表达式 这几个正则表达式学习资料及工具你必须有!
    零基础建站如何配置PHP运行环境 几种服务器环境配置的选择和方法
    php代码如何加域名授权?开源php项目如何保护版权 商业授权?
  • 原文地址:https://www.cnblogs.com/seyjs/p/11526070.html
Copyright © 2011-2022 走看看