题解 | 队列消数

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

        int time = 0;

        while (!q.empty()) {
            int cur = q.front();
            q.pop();
            time++;

            if (tickets[cur] > 1) {
                tickets[cur]--;
                q.push(cur);
            } else {
                if (cur == k) {
                    return time;
                }
            }
        }

        return -1;
    }
};