数据结构之队列

interface queueinterface{
	 public boolean isempty();
	 public boolean isfull();
	 public boolean enqueue(Object k);
	 public Object dequeue();
 }
  class queue1 implements queueinterface{
	  private Object table[];
	  private int front,rear;
	  public queue1(int n) {
		  table=new Object[n];
		  front=rear=0;
	  }
	  public boolean isempty() {
		  return front==rear;
	  }
	  public boolean isfull() {
		  return front==(rear+1)%table.length;
	  }
	  public boolean enqueue(Object k) {
		  if(!isfull()) {
			  table[rear]=k;
			  rear=(rear+1)%table.length;
			  return true;
		  }else {
			  System.out.println("队列已满，无法加入");
			  return false;
		  }
	  }
	  public Object dequeue() {
		  Object k=null;
		  if(!isempty()) {
			  k=table[front];
			  table[front]=null;
			  front=(front+1)%table.length;
		  }
		  return k;
	  }
  }
  class queue2 extends onelink1{
	  private onelinknode front,rear;
	  public queue2() {
		  front=rear=null;
	  }
	  public boolean isempty() {
		  return (front==null)&&(rear==null);
	  }
	  public boolean enqueue(int k) {
		  onelinknode q=new onelinknode(k);
		  if(!isempty()) 
			  rear.next=q;
		  else
			  front=q;
		  rear=q;
		  return true;
		  
	  }
	  public int dequeue() {
		  int k=-1;
		  if(!isempty()) {
			  k=front.data;
			  front=front.next;
			  if(front==null)
				  rear=null;
		  }
		  return k;
	  }
	  
	  
	  
  }