package Queue;

public class CQueue {
	private int maxSize = 100;
	private int[] arr = new int[maxSize];
	int rear, front;

	public CQueue() {
	}

	public void enQueue(int num) {
		if (((rear + 1) % maxSize) == front) {
			System.out.println("此队列已溢出。");
			return;
		}
		arr[rear] = num;
		rear = (rear + 1) % maxSize;
	}

	public void delQueue() {
		if (front == rear) {
			System.out.println("此对列为空。");
			return;
		}
		front = (front + 1) % maxSize;
	}

	public int size() {
		return rear-front;
	}

	public void clear() {
		front =0;
		rear=0;
	}

	public boolean isEmpty() {
		return front == rear;
	}

	public int head() {
		return arr[front];
	}
	
	public void show(){
		if(rear>front){
			for(int i=front;i<=rear;i++){
				System.out.println(arr[i]);
			}
		}
		if(front>rear){
			for(int i=rear+2;i<=front;i++){
				System.out.println(arr[i]);
			}
			for(int i=rear;i<maxSize;i++){
				System.out.println(arr[i]);
			}
		}
	}

}