第二十天：循环队列

概念：将顺序队列臆造成为一个环状的空间，即把存储队列元素的表从逻辑上视为一个环，称为循环队列。当丢列指针Q.front=MaxSize-1后，在前进一个位置就自动到0，这可以利用除法取余运算来实现。

---

循环队列的一些特征，来自王道教材：

 

总结：

 

判断空：

 入队：

 出队：

 

实战演示：循环队列的基本操作

package day_20;

public class day20 {

	
	public static final int TOTAL_SPACE = 10;

	
	int[] data;

	//定义头尾
	int head;

	int tail;

	
	public day20() {
		data = new int[TOTAL_SPACE];
		head = 0;
		tail = 0;
	}

	
	//进队
	public void enqueue(int paraValue) {
		if ((tail + 1) % TOTAL_SPACE == head) {
			System.out.println("Queue full.");
			return;
		} // Of if

		data[tail % TOTAL_SPACE] = paraValue;
		tail++;
	}// Of enqueue

	
	//出队
	public int dequeue() {
		if (head == tail) {
			System.out.println("No element in the queue");
			return -1;
		} // Of if

		int resultValue = data[head % TOTAL_SPACE];

		head++;

		return resultValue;
	}// Of dequeue

	
	public String toString() {
		String resultString = "";

		if (head == tail) {
			return "empty";
		} // Of if

		for (int i = head; i < tail; i++) {
			resultString += data[i % TOTAL_SPACE] + ", ";
		} // Of for i

		return resultString;
	}// Of toString

	public static void main(String args[]) {
		day20 tempQueue = new day20();
		System.out.println("Initialized, the list is: " + tempQueue.toString());

		for (int i = 0; i < 5; i++) {
			tempQueue.enqueue(i + 1);
		} 
		System.out.println("Enqueue, the queue is: " + tempQueue.toString());

		int tempValue = tempQueue.dequeue();
		System.out.println("Dequeue " + tempValue + ", the queue is: " + tempQueue.toString());

		for (int i = 0; i < 6; i++) {
			tempQueue.enqueue(i + 10);
			System.out.println("Enqueue, the queue is: " + tempQueue.toString());
		} // Of for i

		for (int i = 0; i < 3; i++) {
			tempValue = tempQueue.dequeue();
			System.out.println("Dequeue " + tempValue + ", the queue is: " + tempQueue.toString());
		} // Of for i

		for (int i = 0; i < 6; i++) {
			tempQueue.enqueue(i + 100);
			System.out.println("Enqueue, the queue is: " + tempQueue.toString());
		} // Of for i
	}// Of main

}// Of CircleIntQueue

结果：