# 【LeetCode】队列&栈

#### 队列&栈

###### 1、设计循环队列

``````class MyCircularQueue {
private:
vector<int> data;
int tail;
int size;
public:
/** Initialize your data structure here. Set the size of the queue to be k. */
MyCircularQueue(int k) {
data.resize(k);
tail=-1;
size=k;
}

/** Insert an element into the circular queue. Return true if the operation is successful. */
bool enQueue(int value) {
if(isFull())
return false;
if(isEmpty())
{
}
tail=(tail+1)%size;
data[tail]=value;
return true;
}

/** Delete an element from the circular queue. Return true if the operation is successful. */
bool deQueue() {
if(isEmpty())
{
return false;
}
{
tail=-1;
return true;
}
return true;
}

/** Get the front item from the queue. */
int Front() {
if(isEmpty())
return -1;
}

/** Get the last item from the queue. */
int Rear() {
if(isEmpty())
return -1;
return data[tail];
}

/** Checks whether the circular queue is empty or not. */
bool isEmpty() {
}

/** Checks whether the circular queue is full or not. */
bool isFull() {
}
};

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