Java中的循環(huán)隊列怎么利用數(shù)組實現(xiàn)

//循環(huán)隊列
class CirQueue{
 private int QueueSize;
 private int front;
 private int rear;
 private int[] queueList ;
 
 public CirQueue(int QueueSize){
  this.QueueSize = QueueSize; 
  queueList = new int[QueueSize];
  front = 0;
  rear = 0;
 }
 
 //獲取隊列頭元素
 public int getQueueElement(){
  //如果隊列不為空，返回隊頭元素，否則拋出異常提示隊列為空
  int element = -1;
  if(!isEmpty()){
   element = queueList[front];
   return element;
  }
  else {
   System.out.println("隊列為空");
   return -1;
  }
  
 }
 
 //出隊
 public int deQueue(){
  int element = -1;
  if(!isEmpty()){
   element = queueList[front];
   front =(front+1)%QueueSize;
   return element;
  }
  else {
   System.out.println("隊列為空");
   return -1;
  }
  
 }
 
 
 
 
 
 //入隊
 public void enQueue(int element){
  //如果隊列未滿，添加元素到隊尾，否則提示隊列已滿
  if(!isFull()){
   queueList[rear] = element ;
   rear = (rear+1)%QueueSize;
   
  }
  else {
   System.out.println("隊列已滿");
  }
 }
 
 //判斷隊列是否為空
 public boolean isEmpty(){
  boolean b = false;
  if(rear == front)
   b = true;
  return b;
 }
 
 
 //判斷隊列是否已滿
 public boolean isFull(){
  boolean b = false;
  if((rear+1)%QueueSize == front)
   b = true;
  return b;
 }

}

package com.test;

import java.util.*;


public class StructTest {

 /**
  * @param args
  */
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  
  //新建并初始化存儲空間為3的循環(huán)隊列（方便判斷隊滿條件，浪費一個數(shù)組空間）
  CirQueue cirQueue = new CirQueue(4);
  //入隊3個元素
  cirQueue.enQueue(1);
  cirQueue.enQueue(2);
  cirQueue.enQueue(3);
  
  //獲取隊頭元素,獲取 但不改變隊列
  int temp = cirQueue.getQueueElement();
  System.out.println(temp);
  
  //出隊 獲取隊頭元素，并且隊頭指針往后移一位
  temp = cirQueue.deQueue();
  System.out.println(temp);
  
  //再次獲取隊頭元素
  temp = cirQueue.getQueueElement();
  System.out.println(temp);
  
  
 }

}

1
1
2