题解 | 队列消数

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param tickets int整型vector 
     * @param k int整型 
     * @return int整型
     */
    int timeRequiredToBuy(vector<int>& tickets, int k) {
        // write code here
        queue<int> duilie;
        int counter = k + 1;
        int ans = 0;
        for (int i = 0; i < tickets.size(); i++){
            duilie.push(tickets[i]);            
        }

        while (true) {
            if (duilie.front() > 1){
                counter--;
                if (counter == 0){
                    counter = duilie.size();
                }
                duilie.push(duilie.front() - 1);
                duilie.pop();
            }
            else if (duilie.front() <= 1){
                counter--;
                if (counter == 0){
                    ans++;
                    break;
                }
                else{
                    duilie.pop();
                }
            }
            ans++;
        }
        return ans;
    }
};