题解 | 队列消数

#简单的模拟，也写错好几遍、没有用更好的方法，透过题目看到本质，惭愧
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param tickets int整型一维数组 
# @param k int整型 
# @return int整型
#
class Solution:
    def timeRequiredToBuy(self , tickets: List[int], k: int) -> int:
        # write code here
        time = 0
        left = 0
        right = len(tickets) -1
        while(True):
            if tickets[k] == 0:
                break
            time += 1
            if tickets[left] >1:
                tickets[left] -= 1
                tickets.append(tickets[left])
                left +=1
                right +=1
                if (left-1) == k:
                    k = right
            else:
                tickets[left] -= 1
                left +=1
        return time