package Queue;

public class seQueue {
	public final int maxSize = 100;
	public int[] arr = new int[maxSize];
	public int front, rear;

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

	public void delQueue() {
		if ((rear == front && rear == maxSize - 1) || (rear <=front)) {
			System.out.println("队列已为空。");
			return;
		}
		front++;
	}

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

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

	public boolean isEmpty() {
		return (rear == front && rear == maxSize - 1) || (rear == front && rear == 0);
	}

	public int head() {
		return arr[front];
	}
	
	public void show(){
		if (rear == maxSize - 1) {
			System.out.println("此队列已溢出。");
			return;
		}
		if ((rear == front && rear == maxSize - 1) || (rear <=front)) {
			System.out.println("队列已为空。");
			return;
		}
		for (int i = front; i <rear; i++) {
			System.out.println(arr[i]);
		}
	}

}