java实现循环队列

java实现循环队列

public class Queue {
	int maxcount; //最大长度
	int count;  //当前长度
	Object[] a;
	int front;  //头指针
	int rear;  //尾指针
	public Queue(int size) { //初始化队列
		a=new Object[size];
		front=0;
		rear=0;
		count=0;
		maxcount=size;
	}
	
	public boolean isEmpty() {  //判空
		return front==rear;
	}
	
	public boolean isfull() {  //判满
		return (rear+1)%maxcount==front;
	}
	
	public void enQueue(Object n) { //入队
		if(isfull()) {
			return;
		}else{
			rear=(rear+1)%maxcount;
			this.a[rear]=n;
			count++;
		}
	}
	
	public Object deQueue() {  //出队
		if(isEmpty()) {
			return null;
		}else {
			front=(front+1)%maxcount;
			count--;
			return a[front];
		}
	}
	
	public int length() { //判断长度
		return this.count;
	}
	
	public static void main(String[] args) {
		Queue queue=new Queue(4);
		queue.enQueue('a');
		queue.enQueue('b');
		queue.enQueue('c');
		System.out.println("队列长度："+queue.length());
		System.out.println("是否空："+queue.isEmpty());
		System.out.println("是否满："+queue.isfull());
		System.out.println(queue.deQueue());
	}

}