队列的数组模拟
class ArrayQueue{
private int front;
private int back;
private int maxSize;
private int[] Array;
public ArrayQueue(int AmaxSize) {
maxSize=AmaxSize ;
Array = new int [maxSize];
front = -1;
back = -1;
}
public boolean isFull(){
if(back == maxSize-1){
return true;
}return false;
}
public boolean isEmpty(){
return back == front;
}
public void addQueue(int n){
if(isFull()){
System.out.println("队列已满");
return;
}
back++;
Array[back] = n;
}
public int getQueue(){
if(isEmpty()){
throw new RuntimeException("队列空,不能取数据");
}
front ++;
return Array[front];
}
public void showQueue(){
if(isEmpty()){
System.out.println("队列空,没有数据");
return;
}
for(int i =0; i<Array.length; i++){
System.out.println("Array["+i+"]"+"="+Array[i]);
}
}
public int headQueue(){
if(isEmpty()){
throw new RuntimeException("队列为空");
}
return Array[front+1];
}
}