循环队列(Circular Queue)
- 循环队列底层用数组实现。
- 队列底层也可以使用动态数组实现,并且各项接口也可以优化到O(1)的时间复杂度这个用数组实现优化之后的队列也叫做:循环队列。
- 上述图示:
①、front == tail
时队列为空
②、front==(tail + 1) % c
队列为满
③、capacity
中,浪费一个空间
package com.mj.circle;
public class CircleQueue<E> {
private int front;
private int size;
private E[] elements;
private static final int DEFAULT_CAPACITY = 10;
@SuppressWarnings("unchecked")
public CircleQueue() {
elements = (E[]) new Object[DEFAULT_CAPACITY];
}
/* 元素的数量 */
public int size() {
return size();
}
/* 是否为空 */
public boolean isEmpty() {
return size==0;
}
/* 入队 */
public void enQueue(E element) {
ensureCapacity(size + 1);
elements[(front + size) % elements.length] = element;
size++;
}
private void ensureCapacity(int capacity) {
int oldCapacity = elements.length;
if (oldCapacity >= capacity) return;
// 新容量为旧容量的1.5倍
int newCapacity = oldCapacity + (oldCapacity >> 1);
E[] newElements = (E[]) new Object[newCapacity];
for (int i = 0; i < size; i++) {
newElements[i] = elements[(i + front) % elements.length];
}
elements = newElements;
}
/* 出队 */
public E deQueue() {
E frontElement = elements[front];
elements[front] = null;
front = (front + 1) % elements.length;
size--;
return frontElement;
}
/* 获取队列的头元素 */
public E front() {
return elements[front];
}
/* 清空 */
public void clear() {
for (int i = 0; i < size; i++) {
elements[index(i)] = null;
}
front = 0;
size = 0;
}
@Override
public String toString() {
StringBuilder string = new StringBuilder();
string.append("capcacity=").append(elements.length)
.append(" size=").append(size)
.append(" front=").append(front)
.append(", [");
for (int i = 0; i < elements.length; i++) {
if (i != 0) {
string.append(", ");
}
string.append(elements[i]);
}
string.append("]");
return string.toString();
}
}
测试:
import com.mj.circle.CircleQueue;
public class Main {
static void test2() {
CircleQueue<Integer> queue = new CircleQueue<Integer>();
// 0 1 2 3 4 5 6 7 8 9
for (int i = 0; i < 10; i++) {
queue.enQueue(i);
}
System.out.println(queue);
// null null null null null 5 6 7 8 9
for (int i = 0; i < 5; i++) {
queue.deQueue();
}
System.out.println(queue);
// 15 16 17 18 19 5 6 7 8 9
for (int i = 15; i < 20; i++) {
queue.enQueue(i);
}
System.out.println(queue);
while (!queue.isEmpty()) {
System.out.print(queue.deQueue()+" ");
}
System.out.println();
System.out.println(queue);
}
public static void main(String[] args) {
test2();
}
}
运行结果:
capcacity=10 size=10 front=0, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
capcacity=10 size=5 front=5, [null, null, null, null, null, 5, 6, 7, 8, 9]
capcacity=10 size=10 front=5, [15, 16, 17, 18, 19, 5, 6, 7, 8, 9]
5 6 7 8 9 15 16 17 18 19
capcacity=10 size=0 front=5, [null, null, null, null, null, null, null, null, null, null]
循环队列(Circular Queue)
- 循环双端队列:可以进行两端添加、删除操作的循环队列
@SuppressWarnings("unchecked")
public class CircleDeque<E> {
private int front;
private int size;
private E[] elements;
private static final int DEFAULT_CAPACITY = 10;
public CircleDeque() {
elements = (E[]) new Object[DEFAULT_CAPACITY];
}
public int size() {
return size;
}
public boolean isEmpty() {
return size == 0;
}
public void clear() {
for (int i = 0; i < size; i++) {
elements[index(i)] = null;
}
front = 0;
size = 0;
}
/**
* 从尾部入队
* @param element
*/
public void enQueueRear(E element) {
ensureCapacity(size + 1);
elements[index(size)] = element;
size++;
}
/**
* 从头部出队
* @param element
*/
public E deQueueFront() {
E frontElement = elements[front];
elements[front] = null;
front = index(1);
size--;
return frontElement;
}
/**
* 从头部入队
* @param element
*/
public void enQueueFront(E element) {
ensureCapacity(size + 1);
front = index(-1);
elements[front] = element;
size++;
}
/**
* 从尾部出队
* @param element
*/
public E deQueueRear() {
int rearIndex = index(size - 1);
E rear = elements[rearIndex];
elements[rearIndex] = null;
size--;
return rear;
}
public E front() {
return elements[front];
}
public E rear() {
return elements[index(size - 1)];
}
@Override
public String toString() {
StringBuilder string = new StringBuilder();
string.append("capcacity=").append(elements.length)
.append(" size=").append(size)
.append(" front=").append(front)
.append(", [");
for (int i = 0; i < elements.length; i++) {
if (i != 0) {
string.append(", ");
}
string.append(elements[i]);
}
string.append("]");
return string.toString();
}
private int index(int index) {
index += front;
if (index < 0) {
return index + elements.length;
}
return index - (index >= elements.length ? elements.length : 0);
}
/**
* 保证要有capacity的容量
* @param capacity
*/
private void ensureCapacity(int capacity) {
int oldCapacity = elements.length;
if (oldCapacity >= capacity) return;
// 新容量为旧容量的1.5倍
int newCapacity = oldCapacity + (oldCapacity >> 1);
E[] newElements = (E[]) new Object[newCapacity];
for (int i = 0; i < size; i++) {
newElements[i] = elements[index(i)];
}
elements = newElements;
// 重置front
front = 0;
}
}
测试:
package com.mj;
import com.mj.circle.CircleDeque;
import com.mj.circle.CircleQueue;
public class Main {
static void test3() {
CircleDeque<Integer> queue = new CircleDeque<>();
// 头5 4 3 2 1 100 101 102 103 104 105 106 8 7 6 尾
// 头 8 7 6 5 4 3 2 1 100 101 102 103 104 105 106 107 108 109 null null 10 9 尾
for (int i = 0; i < 10; i++) {
queue.enQueueFront(i + 1);
queue.enQueueRear(i + 100);
}
System.out.println(queue);
// 头 null 7 6 5 4 3 2 1 100 101 102 103 104 105 106 null null null null null null null 尾
for (int i = 0; i < 3; i++) {
queue.deQueueFront();
queue.deQueueRear();
}
System.out.println(queue);
// 头 11 7 6 5 4 3 2 1 100 101 102 103 104 105 106 null null null null null null 12 尾
queue.enQueueFront(11);
queue.enQueueFront(12);
System.out.println(queue);
while (!queue.isEmpty()) {
System.out.print(queue.deQueueFront()+" ");
}
}
public static void main(String[] args) {
test3();
}
}
运行结果:
capcacity=22 size=20 front=20, [8, 7, 6, 5, 4, 3, 2, 1, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, null, null, 10, 9]
capcacity=22 size=14 front=1, [null, 7, 6, 5, 4, 3, 2, 1, 100, 101, 102, 103, 104, 105, 106, null, null, null, null, null, null, null]
capcacity=22 size=16 front=21, [11, 7, 6, 5, 4, 3, 2, 1, 100, 101, 102, 103, 104, 105, 106, null, null, null, null, null, null, 12]
12 11 7 6 5 4 3 2 1 100 101 102 103 104 105 106