Java学习day18

1.循环队列的基本实现
循环队列是 队列的一种特殊形式，是为解决队列元素假溢出的而出现的解决形式。在循环队列中判定队列满还是空，常用牺牲一个元素空间，来区别队空或队满。入队前，先判Q.rear+1是否等于Q.front，若是则为队满。而当Q.front=Q.rear时，为队空。

2.代码

package demo1;

public class CircleIntQueue {
	/**
	 * The total space. One space can never be used.
	 */
	public static final int TOTAL_SPACE = 10;
 
	
	int[] data;
 
	int head;
 
	int tail;
 
	//创建循环队列
	public CircleIntQueue() {
		data = new int[TOTAL_SPACE];
		head = 0;
		tail = 0;
	}// Of the first constructor
 
	// 入队
	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
 
	/**
	 *********************
	 * Overrides the method claimed in Object, the superclass of any class.
	 *********************
	 */
	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
 
	// main
	public static void main(String args[]) {
		CircleIntQueue tempQueue = new CircleIntQueue();
		System.out.println("Initialized, the list is: " + tempQueue.toString());
 
		for (int i = 0; i < 5; i++) {
			tempQueue.enqueue(i + 1);
		} // Of for i
		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


}

运行结果如下