题解 | 队列消数

import java.util.*;

public class Solution {
    public int timeRequiredToBuy (int[] tickets, int k) {
        Queue<Integer> queue = new LinkedList<>();
        int target = 0,times = 0;
        for(int i=0;i<tickets.length;i++){
            if(i!=k)queue.offer(tickets[i]);
            else{
                target = tickets[i]+100;//防止队列中有与target相同的元素
                queue.offer(target);
            }
        }
        int cnt = target;
        while(cnt>=101){
            if(queue.peek()==1){
                times++;
                queue.poll();
                continue;
            }
            if(queue.peek()!=target){
                int temp = queue.poll();
                times++;
                temp--;
                queue.offer(temp);
                continue;
            }
            if(queue.peek()==target){
                cnt--;
                times++;
                int temp = queue.poll();
                queue.offer(temp);
            }
        }
        return times;
    }
}