专栏名称: 每日一道算法题
学习算法是一种信仰,每天都需要坚持!
目录
相关文章推荐
九章算法  ·  「九点热评」Meta将被裁员工列入黑名单! ·  2 天前  
算法爱好者  ·  230 亿美元你不卖?我加到 320 ... ·  昨天  
算法与数学之美  ·  又一位!著名数学家,在美近40年后,回到中国! ·  2 天前  
九章算法  ·  「九点热评」亚麻开始用AI打击员工! ·  3 天前  
51好读  ›  专栏  ›  每日一道算法题

638. Shopping Offers

每日一道算法题  · 公众号  · 算法  · 2017-10-29 21:07

正文

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]







请到「今天看啥」查看全文