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.
Implement the MyCircularQueue class:
MyCircularQueue(k) Initializes the object with the size of the queue to be k.int Front() Gets the front item from the queue. If the queue is empty, return -1.int Rear() Gets the last item from the queue. If the queue is empty, return -1.boolean enQueue(int value) Inserts an element into the circular queue. Return true if the operation is successful.boolean deQueue() Deletes an element from the circular queue. Return true if the operation is successful.boolean isEmpty() Checks whether the circular queue is empty or not.boolean isFull() Checks whether the circular queue is full or not.You must solve the problem without using the built-in queue data structure in your programming language.
Example 1:
Input ["MyCircularQueue", "enQueue", "enQueue", "enQueue", "enQueue", "Rear", "isFull", "deQueue", "enQueue", "Rear"] [[3], [1], [2], [3], [4], [], [], [], [4], []] Output [null, true, true, true, false, 3, true, true, true, 4] Explanation MyCircularQueue myCircularQueue = new MyCircularQueue(3); myCircularQueue.enQueue(1); // return True myCircularQueue.enQueue(2); // return True myCircularQueue.enQueue(3); // return True myCircularQueue.enQueue(4); // return False myCircularQueue.Rear(); // return 3 myCircularQueue.isFull(); // return True myCircularQueue.deQueue(); // return True myCircularQueue.enQueue(4); // return True myCircularQueue.Rear(); // return 4
Constraints:
1 <= k <= 10000 <= value <= 10003000 calls will be made to enQueue, deQueue, Front, Rear, isEmpty, and isFull.class MyCircularQueue {
public:
vector<int> q;
int lt=0, rt=0, k=0;
MyCircularQueue(int capacity){
k = capacity;
q.resize(k,-1);
}
bool enQueue(int value) {
if(isFull())
return false;
q[rt++]=value;
rt%=k;
return true;
}
bool deQueue() {
if(isEmpty())
return false;
q[lt++]=-1;
lt%=k;
return true;
}
int Front() {
return q[(k+lt)%k];
}
int Rear() {
return q[(k+rt-1)%k];
}
bool isEmpty() {
return lt==rt && q[(k+lt-2)%k]==-1;
}
bool isFull() {
return rt==lt && q[(k+lt-2)%k]!=-1;
}
};
/**
* Your MyCircularQueue object will be instantiated and called as such:
* MyCircularQueue* obj = new MyCircularQueue(k);
* bool param_1 = obj->enQueue(value);
* bool param_2 = obj->deQueue();
* int param_3 = obj->Front();
* int param_4 = obj->Rear();
* bool param_5 = obj->isEmpty();
* bool param_6 = obj->isFull();
*/class MyCircularQueue {
int[] q;
int front = 0, rear = 0;
int size = 0;
public MyCircularQueue(int k) {
this.q = new int[k];
}
public boolean enQueue(int value) {
if (isFull())
return false;
q[rear] = value;
size++;
rear = (rear + 1) % q.length;
return true;
}
public boolean deQueue() {
if (isEmpty())
return false;
front = (front + 1) % q.length;
size--;
return true;
}
public int Front() {
if (isEmpty())
return -1;
return q[front];
}
public int Rear() {
if (isEmpty())
return -1;
return q[(q.length + rear - 1) % q.length];
}
public boolean isEmpty() {
return size == 0;
}
public boolean isFull() {
return size == 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();
*/