設計循環(huán)隊列的實現(xiàn)。循環(huán)隊列是一種線性數(shù)據(jù)結構，其操作基于FIFO(先進先出)原則，最后一個位置與第一個位置連接形成一個圓圈。它也被稱為“環(huán)形緩沖區(qū)”。

循環(huán)隊列的好處之一是我們可以利用隊列前面的空間。在普通隊列中，一旦隊列滿了，即使隊列前面有空間，我們也無法插入下一個元素。但是使用循環(huán)隊列，我們??可以使用空間來存儲新值。

您的實現(xiàn)應支持以下操作：

MyCircularQueue(k)：構造函數(shù)，設置隊列大小為k。

Front：從隊列中獲取最前面的項目。如果隊列為空，則返回 -1。

Rear：從隊列中獲取最后一項。如果隊列為空，則返回 -1。

enQueue(value): 將一個元素插入循環(huán)隊列。如果操作成功，則返回 true。

deQueue()：從循環(huán)隊列中刪除一個元素。如果操作成功，則返回 true。

isEmpty()：檢查循環(huán)隊列是否為空。

isFull()：檢查循環(huán)隊列是否已滿。

例子：

MyCircularQueue circularQueue = new MycircularQueue(3); // set the size to be 3
circularQueue.enQueue(1);  // return true
circularQueue.enQueue(2);  // return true
circularQueue.enQueue(3);  // return true
circularQueue.enQueue(4);  // return false, the queue is full
circularQueue.Rear();  // return 3
circularQueue.isFull();  // return true
circularQueue.deQueue();  // return true
circularQueue.enQueue(4);  // return true
circularQueue.Rear()

分析

數(shù)組排序實現(xiàn)：

重點是確定循環(huán)的空位和滿員情況，以及下一個前后標的位置。

一個int length可以記錄當前隊列的元素個數(shù)，和循環(huán)周期的大小比較就可以得出是否滿，檢查長度是否為0，則檢測出是否為空。

對后方和前方的下標位置有不同的應用思路：

1.前面代表隊列的頭部元素位置，代表隊列的位置;初始化rear=-1, front=0

2.前面代表隊列的頭部元素位置，代表隊列時可以代表新元素的位置：rear=0, front=0

Tricky不過，對于第一個，讀取Front()和Rear()可以直接用front和rear作為下標，對于2，讀取Rear()時，需要計算下標：(rear + q.length - 1) % q.length

解決方案

數(shù)組實現(xiàn) 1 - init front = 0，rear = -1

class MyCircularQueue {
    private int length;
    private int rear, front;
    private int[] q;
    /** Initialize your data structure here. Set the size of the queue to be k. */
    public MyCircularQueue(int k) {
        q = new int[k];
        length = 0;
        front = 0;
        rear = -1;
    }
    /** Insert an element into the circular queue. Return true if the operation is successful. */
    public boolean enQueue(int value) {
        if (isFull()) {
            return false;
        }
        rear = (rear + 1) % (q.length);
        q[rear] = value;
        length++;
        return true;
    }
    /** Delete an element from the circular queue. Return true if the operation is successful. */
    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        front = (front + 1) % (q.length);
        length--;
        return true;
    }
    /** Get the front item from the queue. */
    public int Front() {
        return isEmpty() ? -1 : q[front];
    }
    /** Get the last item from the queue. */
    public int Rear() {
        return isEmpty() ? -1 : q[rear];
    }
    /** Checks whether the circular queue is empty or not. */
    public boolean isEmpty() {
        return length == 0;
    }
    /** Checks whether the circular queue is full or not. */
    public boolean isFull() {
        return length == q.length;
    }
}
/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue obj = new MyCircularQueue(k);
 * boolean param_1 = obj.enQueue(value);
 * boolean param_2 = obj.deQueue();
 * int param_3 = obj.Front();
 * int param_4 = obj.Rear();
 * boolean param_5 = obj.isEmpty();
 * boolean param_6 = obj.isFull();

數(shù)組實現(xiàn) 2 - init front = 0，rear = 0

class MyCircularQueue {
    private int length;
    private int rear, front;
    private int[] q;
    /** Initialize your data structure here. Set the size of the queue to be k. */
    public MyCircularQueue(int k) {
        q = new int[k];
        length = 0;
        front = 0;
        rear = 0;
    }
    /** Insert an element into the circular queue. Return true if the operation is successful. */
    public boolean enQueue(int value) {
        if (isFull()) {
            return false;
        }
        q[rear] = value;
        rear = (rear + 1) % (q.length);
        length++;
        return true;
    }
    /** Delete an element from the circular queue. Return true if the operation is successful. */
    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        front = (front + 1) % (q.length);
        length--;
        return true;
    }
    /** Get the front item from the queue. */
    public int Front() {
        return isEmpty() ? -1 : q[front];
    }
    /** Get the last item from the queue. */
    public int Rear() {
        return isEmpty() ? -1 : q[(rear + q.length - 1) % q.length];
    }
    /** Checks whether the circular queue is empty or not. */
    public boolean isEmpty() {
        return length == 0;
    }
    /** Checks whether the circular queue is full or not. */
    public boolean isFull() {
        return length == q.length;
    }
}
/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue obj = new MyCircularQueue(k);
 * boolean param_1 = obj.enQueue(value);
 * boolean param_2 = obj.deQueue();
 * int param_3 = obj.Front();
 * int param_4 = obj.Rear();
 * boolean param_5 = obj.isEmpty();
 * boolean param_6 = obj.isFull();

LeetCode 官方解決方案 - 數(shù)組實現(xiàn)

class MyCircularQueue {
    private int[] data;
    private int head;
    private int tail;
    private int size;
    /** Initialize your data structure here. Set the size of the queue to be k. */
    public MyCircularQueue(int k) {
        data = new int[k];
        head = -1;
        tail = -1;
        size = k;
    }
    /** Insert an element into the circular queue. Return true if the operation is successful. */
    public boolean enQueue(int value) {
        if (isFull() == true) {
            return false;
        }
        if (isEmpty() == true) {
            head = 0;
        }
        tail = (tail + 1) % size;
        data[tail] = value;
        return true;
    }
    /** Delete an element from the circular queue. Return true if the operation is successful. */
    public boolean deQueue() {
        if (isEmpty() == true) {
            return false;
        }
        if (head == tail) {
            head = -1;
            tail = -1;
            return true;
        }
        head = (head + 1) % size;
        return true;
    }
    /** Get the front item from the queue. */
    public int Front() {
        if (isEmpty() == true) {
            return -1;
        }
        return data[head];
    }
    /** Get the last item from the queue. */
    public int Rear() {
        if (isEmpty() == true) {
            return -1;
        }
        return data[tail];
    }
    /** Checks whether the circular queue is empty or not. */
    public boolean isEmpty() {
        return head == -1;
    }
    /** Checks whether the circular queue is full or not. */
    public boolean isFull() {
        return ((tail + 1) % size) == head;
    }
}
/**
 * Your MyCircularQueue object will be instantiated and called as such:
 * MyCircularQueue obj = new MyCircularQueue(k);
 * boolean param_1 = obj.enQueue(value);
 * boolean param_2 = obj.deQueue();
 * int param_3 = obj.Front();
 * int param_4 = obj.Rear();
 * boolean param_5 = obj.isEmpty();
 * boolean param_6 = obj.isFull();

使用(雙)鏈表

class ListNode {
    int val;
    ListNode prev, next;
    public ListNode(int x) {
        val = x;
        prev = null;
        next = null;
    }
}
class MyCircularQueue {
    int queueSize, currSize;
    ListNode head, tail;
    /** Initialize your data structure here. Set the size of the queue to be k. */
    public MyCircularQueue(int k) {
        queueSize = k;
        currSize = 0;
        head = new ListNode(-1);
        tail = new ListNode(-1);
        head.next = tail;
        tail.prev = head;
    }
    /** Insert an element into the circular queue. Return true if the operation is successful. */
    public boolean enQueue(int value) {
        if (isFull()) {
            return false;
        }
        ListNode newNode = new ListNode(value);
        newNode.next = tail;
        newNode.prev = tail.prev;
        tail.prev.next = newNode;
        tail.prev = newNode;
        currSize++;
        return true;
    }
    /** Delete an element from the circular queue. Return true if the operation is successful. */
    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        ListNode toBeDeleted = head.next;
        head.next = toBeDeleted.next;
        toBeDeleted.next.prev = head;
        toBeDeleted.next = null;
        toBeDeleted.prev = null;
        currSize--;
        return true;
    }
    /** Get the front item from the queue. */
    public int Front() {
        if(isEmpty()) {
            return -1;
        }
        return head.next.val;
    }
    /** Get the last item from the queue. */
    public int Rear() {
        if(isEmpty()) {
            return -1;
        }
        return tail.prev.val;
    }
    /** Checks whether the circular queue is empty or not. */
    public boolean isEmpty() {
        return currSize == 0;
    }
    /** Checks whether the circular queue is full or not. */
    public boolean isFull() {
        return currSize == queueSize;
    }
}

以上就是關于“設計循環(huán)隊列詳解”的介紹，大家如果想了解更多相關知識，不妨來關注一下動力節(jié)點的Java隊列，里面有更詳細的知識等著大家去學習，希望對大家能夠有所幫助哦。