sequencequeue.java

用java实现队列的一些基本操作

public class SequenceQueue implements Queue{
   public static final int CAP=100;
   private Object[] data;
   private int front,rear;
   private int length=0;
   
   public SequenceQueue()
   {
	   data=new Object[CAP];
	   front=0;
	   rear=0;
   }
   public boolean isEmpty()
   {
	   if(front==rear)
		   return true;
	   else
		   return false;
   }
   public boolean isFull()
   {
	   if((rear+1)%data.length==front)
		   return true;
	   else
		   return false;
   }
   public void enqueue(Object element)
   {
	   if(!isFull())
	   {
		   rear=(rear+1)%data.length;
		   data[rear]=element;
	   }
	   length++;
   }
   public Object dequeue()
   {
	   if(!isEmpty())
	   {
		   front=(front+1)%data.length;
		   return data[front];
	   }
	return data;
   }
   public static void main(String[] args)
   {
	   String a="aa";
	   String b="bb";
	   String c="cc";
	   int len;
	   
	   SequenceQueue L=new  SequenceQueue();
	   L.enqueue(a);
	   L.enqueue(b);
	   L.enqueue(c);
	   len=L.length;
	   
	   for(int i=0;i<len;i++)
	   System.out.println(L.dequeue());
	   
   }
}