#include<iostream>
#include<vector>
using namespace std;
class MyCircularDeque {
private:
vector<int> arr;
int front;
int rear;
int length;
public:
/** Initialize your data structure here. Set the size of the deque to be k. */
MyCircularDeque(int k)
{
length = k + 1;
arr.assign(length, 0);
front = 0;
rear = 0;
}
/** 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 - 1 + length) % length;
arr[front] = value;
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;
}
arr[rear] = value;
rear = (rear + 1) % length;
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 + 1) % length;
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 - 1 + length) % length;
return true;
}
/** Get the front item from the deque. */
int getFront()
{
if(isEmpty())
{
return -1;
}
return arr[front];
}
/** Get the last item from the deque. */
int getRear()
{
if(isEmpty())
{
return -1;
}
return arr[(rear - 1 + length) % length];
}
/** Checks whether the circular deque is empty or not. */
bool isEmpty()
{
return front == rear;
}
/** Checks whether the circular deque is full or not. */
bool isFull()
{
return (rear + 1) % length == front;
}
};
/**
* Your MyCircularDeque object will be instantiated and called as such:
* MyCircularDeque* obj = new MyCircularDeque(k);
* bool param_1 = obj->insertFront(value);
* bool param_2 = obj->insertLast(value);
* bool param_3 = obj->deleteFront();
* bool param_4 = obj->deleteLast();
* int param_5 = obj->getFront();
* int param_6 = obj->getRear();
* bool param_7 = obj->isEmpty();
* bool param_8 = obj->isFull();
*/
public class MyCircularDeque {
private int pFront;
private int pRear;
private int length;
private int maxSize;
private int[] dataset;
/** Initialize your data structure here. Set the size of the deque to be k. */
public MyCircularDeque(int k)
{
if(k <= 0)
return;
pFront = 0;
pRear = 0;
length = 0;
maxSize = k;
dataset = new int[maxSize];
}
/** Adds an item at the front of Deque. Return true if the operation is successful. */
public bool InsertFront(int value)
{
if(maxSize == length)
return false;
pFront = (pFront - 1 + maxSize) % maxSize;
dataset[pFront] = value;
length++;
return true;
}
/** Adds an item at the rear of Deque. Return true if the operation is successful. */
public bool InsertLast(int value)
{
if(maxSize == length)
return false;
dataset[pRear] = value;
pRear = (pRear + 1) % maxSize;
length++;
return true;
}
/** Deletes an item from the front of Deque. Return true if the operation is successful. */
public bool DeleteFront()
{
if(length == 0)
return false;
pFront = (pFront + 1) % maxSize;
length--;
return true;
}
/** Deletes an item from the rear of Deque. Return true if the operation is successful. */
public bool DeleteLast()
{
if(length == 0)
return false;
pRear = (pRear - 1 + maxSize) % maxSize;
length--;
return true;
}
/** Get the front item from the deque. */
public int GetFront()
{
if(length == 0)
return -1;
return dataset[pFront];
}
/** Get the last item from the deque. */
public int GetRear()
{
if(length == 0)
return -1;
return dataset[(pRear - 1 + maxSize) % maxSize];
}
/** Checks whether the circular deque is empty or not. */
public bool IsEmpty()
{
return length == 0;
}
/** Checks whether the circular deque is full or not. */
public bool IsFull()
{
return length == maxSize;
}
}
/**
* Your MyCircularDeque object will be instantiated and called as such:
* MyCircularDeque obj = new MyCircularDeque(k);
* bool param_1 = obj.InsertFront(value);
* bool param_2 = obj.InsertLast(value);
* bool param_3 = obj.DeleteFront();
* bool param_4 = obj.DeleteLast();
* int param_5 = obj.GetFront();
* int param_6 = obj.GetRear();
* bool param_7 = obj.IsEmpty();
* bool param_8 = obj.IsFull();
*/