1.循环队列
循环队列是把顺序队列首尾相连，把存储队列元素的表从逻辑上看成一个环，成为循环队列。
2.入队
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
3.出队
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
4.完整代码
package com.datastructure;
public class CircleIntQueue {
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
public String toString() {
String resultString = "";
if(head == tail) {
return "empty";
}
for (int i = head; i < tail; i++) {
resultString += data[i % TOTAL_SPACE] + ", ";
}
return resultString;
}// of toString
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);
}
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
运行结果
