622. Design Circular Queue

最新推荐文章于 2020-10-07 11:32:24 发布

EternityPerson

最新推荐文章于 2020-10-07 11:32:24 发布

阅读量176

点赞数

本文链接：https://blog.csdn.net/EternityPerson/article/details/88084337

版权

622. Design Circular Queue

Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer".

One of the benefits of the circular queue is that we can make use of the spaces in front of the queue. In a normal queue, once the queue becomes full, we cannot insert the next element even if there is a space in front of the queue. But using the circular queue, we can use the space to store new values.

Your implementation should support following operations:

MyCircularQueue(k): Constructor, set the size of the queue to be k.
Front: Get the front item from the queue. If the queue is empty, return -1.
Rear: Get the last item from the queue. If the queue is empty, return -1.
enQueue(value): Insert an element into the circular queue. Return true if the operation is successful.
deQueue(): Delete an element from the circular queue. Return true if the operation is successful.
isEmpty(): Checks whether the circular queue is empty or not.
isFull(): Checks whether the circular queue is full or not.

Example:

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();  // return 4

Note:

All values will be in the range of [0, 1000].
The number of operations will be in the range of [1, 1000].
Please do not use the built-in Queue library.

State the problem (as you understand it):

Implement a circular queue

Solve examples that are big enough and are normal cases (manually to figure out the general solution):

Ask clarification questions:

State assumptions:

Consider several test cases (edge cases, base cases):

See if a Data Structure fits the problem:

use an array
use a linked list with head and tail pointers

See if an Algorithm fits the problem:

ad-hoc algorithm

Extract the core problem:

implement a circular queue

Try breaking it down into subproblems:

Explain Potential Solutions (see solutin section):

Other solutions:

Compare solutions:

easier to use linked list since for array you need to figure out indices to use for the front and rear pointers

Follow Up (TODO):

Solution 1:

Ideas:

keep variables for size, the front and rear pointer.
start from index 0 and -1 for the front and rear pointers respectively and increment as they are used; mod the pointers by the array size to make the array circular

Steps:

create instance variables
1. use int array to keep track of elements
2. use int size to keep track of current size of array
3. use int rear to keep track of insert index
4. use int front to keep track of remove index
implement enQueue method
1. return false if array is full
2. increment the rear pointer and set the given value
3. increment size
implement deQueue method
1. return false if array is full
2. increment the front pointer
3. decrement size

Validate the correctness (of your pseudocode with a test case):

Data Structure:

use an array

Time Complexity:

O(1)

Space Complexity:

O(k), where k is the number of elements in the buffer

class MyCircularQueue {
    
    private int[] buffer;
    private int front = 0;
    private int rear = -1;
    private int size = 0;

    /** Initialize your data structure here. Set the size of the queue to be k. */
    public MyCircularQueue(int k) {
        this.buffer = new int[k];
    }
    
    /** Insert an element into the circular queue. Return true if the operation is successful. */
    public boolean enQueue(int value) {
        if (this.isFull()) {
            return false;    
        }
        
        this.rear = (this.rear + 1) % this.buffer.length;
        this.buffer[this.rear] = value;
        this.size++;
        return true;
    }
    
    /** Delete an element from the circular queue. Return true if the operation is successful. */
    public boolean deQueue() {
        if (this.isEmpty()) {
            return false;
        }   
        
        this.front = (this.front + 1) % this.buffer.length;
        this.size--;
        return true;
    }
    
    /** Get the front item from the queue. */
    public int Front() {
        return this.isEmpty() ? -1 : this.buffer[front];
    }
    
    /** Get the last item from the queue. */
    public int Rear() {
        return this.isEmpty() ? -1 : this.buffer[rear];    
    }
    
    /** Checks whether the circular queue is empty or not. */
    public boolean isEmpty() {
        return this.size == 0;    
    }
    
    /** Checks whether the circular queue is full or not. */
    public boolean isFull() {
        return this.buffer.length == this.size;    
    }
}

/**
 * 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();
 */

Test your code again to make sure you don't have any bugs.

Solution 2: