641. Design Circular Deque LeetCode Solution
In this guide, you will get 641. Design Circular Deque LeetCode Solution with the best time and space complexity. The solution to Design Circular Deque problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Table of Contents
- Problem Statement
- Complexity Analysis
- Design Circular Deque solution in C++
- Design Circular Deque solution in Java
- Design Circular Deque solution in Python
- Additional Resources
Problem Statement of Design Circular Deque
Design your implementation of the circular double-ended queue (deque).
Implement the MyCircularDeque class:
MyCircularDeque(int k) Initializes the deque with a maximum size of k.
boolean insertFront() Adds an item at the front of Deque. Returns true if the operation is successful, or false otherwise.
boolean insertLast() Adds an item at the rear of Deque. Returns true if the operation is successful, or false otherwise.
boolean deleteFront() Deletes an item from the front of Deque. Returns true if the operation is successful, or false otherwise.
boolean deleteLast() Deletes an item from the rear of Deque. Returns true if the operation is successful, or false otherwise.
int getFront() Returns the front item from the Deque. Returns -1 if the deque is empty.
int getRear() Returns the last item from Deque. Returns -1 if the deque is empty.
boolean isEmpty() Returns true if the deque is empty, or false otherwise.
boolean isFull() Returns true if the deque is full, or false otherwise.
Example 1:
Input
[“MyCircularDeque”, “insertLast”, “insertLast”, “insertFront”, “insertFront”, “getRear”, “isFull”, “deleteLast”, “insertFront”, “getFront”]
[[3], [1], [2], [3], [4], [], [], [], [4], []]
Output
[null, true, true, true, false, 2, true, true, true, 4]
Explanation
MyCircularDeque myCircularDeque = new MyCircularDeque(3);
myCircularDeque.insertLast(1); // return True
myCircularDeque.insertLast(2); // return True
myCircularDeque.insertFront(3); // return True
myCircularDeque.insertFront(4); // return False, the queue is full.
myCircularDeque.getRear(); // return 2
myCircularDeque.isFull(); // return True
myCircularDeque.deleteLast(); // return True
myCircularDeque.insertFront(4); // return True
myCircularDeque.getFront(); // return 4
Constraints:
1 <= k <= 1000
0 <= value <= 1000
At most 2000 calls will be made to insertFront, insertLast, deleteFront, deleteLast, getFront, getRear, isEmpty, isFull.
Complexity Analysis
- Time Complexity: O(1)
- Space Complexity: O(k)
641. Design Circular Deque LeetCode Solution in C++
class MyCircularDeque {
public:
/** Initialize your data structure here. Set the size of the deque to be k. */
MyCircularDeque(int k) : k(k), q(k), rear(k - 1) {}
/** Adds an item at the front of Deque. Return true if the operation is
* successful. */
bool insertFront(int value) {
if (isFull())
return false;
front = (--front + k) % k;
q[front] = value;
++size;
return true;
}
/** Adds an item at the rear of Deque. Return true if the operation is
* successful. */
bool insertLast(int value) {
if (isFull())
return false;
rear = ++rear % k;
q[rear] = value;
++size;
return true;
}
/** Deletes an item from the front of Deque. Return true if the operation is
* successful. */
bool deleteFront() {
if (isEmpty())
return false;
front = ++front % k;
--size;
return true;
}
/** Deletes an item from the rear of Deque. Return true if the operation is
* successful. */
bool deleteLast() {
if (isEmpty())
return false;
rear = (--rear + k) % k;
--size;
return true;
}
/** Get the front item from the deque. */
int getFront() {
return isEmpty() ? -1 : q[front];
}
/** Get the last item from the deque. */
int getRear() {
return isEmpty() ? -1 : q[rear];
}
/** Checks whether the circular deque is empty or not. */
bool isEmpty() {
return size == 0;
}
/** Checks whether the circular deque is full or not. */
bool isFull() {
return size == k;
}
private:
const int k;
vector<int> q;
int size = 0;
int front = 0;
int rear;
};
/* code provided by PROGIEZ */641. Design Circular Deque LeetCode Solution in Java
class MyCircularDeque {
/** Initialize your data structure here. Set the size of the deque to be k. */
public MyCircularDeque(int k) {
this.k = k;
this.q = new int[k];
this.rear = k - 1;
}
/** Adds an item at the front of Deque. Return true if the operation is successful. */
public boolean insertFront(int value) {
if (isFull())
return false;
front = (--front + k) % k;
q[front] = value;
++size;
return true;
}
/** Adds an item at the rear of Deque. Return true if the operation is successful. */
public boolean insertLast(int value) {
if (isFull())
return false;
rear = ++rear % k;
q[rear] = value;
++size;
return true;
}
/** Deletes an item from the front of Deque. Return true if the operation is successful. */
public boolean deleteFront() {
if (isEmpty())
return false;
front = ++front % k;
--size;
return true;
}
/** Deletes an item from the rear of Deque. Return true if the operation is successful. */
public boolean deleteLast() {
if (isEmpty())
return false;
rear = (--rear + k) % k;
--size;
return true;
}
/** Get the front item from the deque. */
public int getFront() {
return isEmpty() ? -1 : q[front];
}
/** Get the last item from the deque. */
public int getRear() {
return isEmpty() ? -1 : q[rear];
}
/** Checks whether the circular deque is empty or not. */
public boolean isEmpty() {
return size == 0;
}
/** Checks whether the circular deque is full or not. */
public boolean isFull() {
return size == k;
}
private final int k;
private int[] q;
private int size = 0;
private int front = 0;
private int rear;
}
// code provided by PROGIEZ641. Design Circular Deque LeetCode Solution in Python
N/A
# code by PROGIEZAdditional Resources
- Explore all LeetCode problem solutions at Progiez here
- Explore all problems on LeetCode website here
Happy Coding! Keep following PROGIEZ for more updates and solutions.