循环队列（java）

核心code：

//创建数组队列类
class queue {
   private int maxsize;
   private int front;
   private int rear;
   private int[] queue;

   //创建构造器
   public queue(int maxsize) {
       this.maxsize = maxsize;
       this.front = 0;
       this.rear = 0;
       this.queue = new int[maxsize];
   }

   //判断队列是否为空
   public boolean QueueEmpty() {
       return rear == front;
   }

   //判断队列是否为满
   public boolean QueueFull() {
       return rear == (front + 1) % maxsize;
   }

   //入队操作
   public boolean InQueue(int a) {
       if (QueueFull()) {
           System.out.println("队列已满");
           return false;
       }
       queue[(++rear) % maxsize] = a;
       return true;
   }

   //出队操作
   public boolean OutQueue(int a) {
       if (QueueEmpty()) return false;
       queue[(++front) % maxsize] = a;
       return true;
   }

   //查看队头
   public int TopQueue() {
       if (QueueEmpty()) throw new RuntimeException("队列为空，无法取出");
       return queue[front];
   }
}

作者：奋斗的蒟蒻 https://www.bilibili.com/read/cv16194960 出处：bilibili