import java.util.*; public class Solution { /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param tickets int整型一维数组 * @param k int整型 * @return int整型 */ public int timeRequiredToBuy (int[] tickets, int k) { // write code here Queue<Integer> queue = new LinkedList<>(); int n=tickets.length; int count=0; for(int i=0;i<n;i++){ queue.offer(tickets[i]); } while(!queue.isEmpty()){ if(k==0 && queue.peek()==1){ count++; return count; }else if(k==0 && queue.peek()>1){ count++; k=queue.size()-1; queue.offer(queue.poll()-1); }else if(k>0 && queue.peek()==1){ count++; queue.poll(); k--; }else if(k>0 && queue.peek()>1){ count++; k--; queue.offer(queue.poll()-1); } } return count; } }