题目
代码
class Solution:
def timeRequiredToBuy(self, tickets: List[int], k: int) -> int:
timeConsume=0
for idx,item in enumerate(tickets):
if idx<=k:
timeConsume+=min(tickets[idx],tickets[k])
else:
timeConsume+=min(tickets[idx],tickets[k]-1)
return timeConsume
【方法2:简单模拟】
class Solution:
def timeRequiredToBuy(self, tickets: List[int], k: int) -> int:
timeConsume=0
while tickets[k]>0:
for i in range(len(tickets)):
if tickets[i]>0:
tickets[i]-=1
timeConsume+=1
if tickets[k]==0:
return timeConsume
return timeConsume