队列

类

public class Queue {
	private long[] queArray;
	private int maxSize;
	private int front;
	private int rear;
	private int nItems;
	public Queue(int s){
		maxSize=s;
		queArray=new long[maxSize];
		front=0;
		rear=-1;
		nItems=0;
	}
	public void insert(long value){
		if(rear==maxSize-1) rear=-1;
		queArray[++rear]=value;
		nItems++;
	}
	public long remove(){
		long temp=queArray[front++];
		if(front==maxSize) front=0;
		nItems--;
		return temp;
	}
	public long peekFront(){
		return queArray[front];
	}
	public boolean isEmpty(){
		return nItems==0;
	}
	public boolean isFull(){
		return nItems==maxSize;
	}
	public int size(){
		return nItems;
	}
}

主程序

public class QueueApp {
	public static void main(String[] args){
		Queue theQueue=new Queue(5);
		theQueue.insert(10);
		theQueue.insert(20);
		theQueue.insert(30);
		theQueue.insert(40);
		System.out.println(theQueue.remove());
		System.out.println(theQueue.remove());
		System.out.println(theQueue.remove());
		theQueue.insert(50);
		theQueue.insert(60);
		theQueue.insert(70);
		theQueue.insert(80);
		while(!theQueue.isEmpty()){
			long n=theQueue.remove();
			System.out.print(n+" ");
		}
	}
}