1 Star 0 Fork 0

yuhang2__2/LeetCode-Solutions

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
apply-discount-every-n-orders.py 899 Bytes
一键复制 编辑 原始数据 按行查看 历史
# Time: ctor: O(m), m is the number of all products
# getBill: O(p), p is the number of products to bill
# Space: O(m)
class Cashier(object):
def __init__(self, n, discount, products, prices):
"""
:type n: int
:type discount: int
:type products: List[int]
:type prices: List[int]
"""
self.__n = n
self.__discount = discount
self.__curr = 0
self.__lookup = {p : prices[i] for i, p in enumerate(products)}
def getBill(self, product, amount):
"""
:type product: List[int]
:type amount: List[int]
:rtype: float
"""
self.__curr = (self.__curr+1) % self.__n
result = 0.0
for i, p in enumerate(product):
result += self.__lookup[p]*amount[i]
return result * (1.0 - self.__discount/100.0 if self.__curr == 0 else 1.0)
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/yuhang2__2/LeetCode-Solutions.git
git@gitee.com:yuhang2__2/LeetCode-Solutions.git
yuhang2__2
LeetCode-Solutions
LeetCode-Solutions
master

搜索帮助