zoukankan      html  css  js  c++  java
  • [Leetcode] DP-- 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.
     
    Solution:
     
    1. use DP:
    initialize spending fromthe retail price,
    recursively iterate the spending for the rest needs,
       compare the retail and each offer and find the minimum spending
     (1) Define the subproblem
     
    dp[needs] indicate the lowest price for the needs 

    (2) Find the recursion (state transition function)

        dp[needs]  = min(dp[needs], dp[needs-offer[:-1]) + offer[-1])

    (3) Get the base case

      dp[needs] = sum of needs and prices   

     1   dp = {}
     2         def shopphelper(needsTpl):
     3             if needsTpl in dp:
     4                 return dp[needsTpl]
     5             #intialize
     6             dp[needsTpl] = sum(t*p for t,p in zip(needsTpl, price)) 
     7             #get each special offer
     8             for sp in special:
     9                 ntuples = tuple((t-s for t,s in zip(needsTpl, sp[:-1])))   #may use sp instead of sp[:-1], zip will be automatically pruning the rest unmatched
    10                 if min(ntuples) < 0:         #more than not exact
    11                     continue 
    12                 dp[needsTpl] = min(dp[needsTpl], shopphelper(ntuples) + sp[-1])
    13             return dp[needsTpl]
    14         
    15         return shopphelper(tuple(needs))    
    16             

          

  • 相关阅读:
    Python 元胞自动机模拟——生命游戏
    ()python画动态图——plt.ion动图使用,训练过程展示
    Python——因子分析(KMO检验和Bartlett's球形检验)
    bind(),unbind(),hover(),toggle(),animate()
    多计算机通信中的时间同步问题
    如何创建自定义尺寸的空白地图
    ROS中的珊格地图——nav_msgs::OccupancyGrid
    c++使用eigen库,矩阵维度错误
    Eigen 求最小二乘
    Mybatis 框架下 SQL 注入攻击的 3 种方式,真是防不胜防!
  • 原文地址:https://www.cnblogs.com/anxin6699/p/7189494.html
Copyright © 2011-2022 走看看