设计循环链表,使用数组。这里判断循环队列满的条件为(tail+1)%n==head,tail指向的位置不保存元素,所以这里讲实际的空间加了1。
class MyCircularQueue {
public:
/** Initialize your data structure here. Set the size of the queue to be k. */
MyCircularQueue(int k) {
n=k+1;
item=new int[n];
head=0;
tail=0;
}
/** Insert an element into the circular queue. Return true if the operation is successful. */
bool enQueue(int value) {
if(isFull()){
return false;
}
item[tail]=value;
tail=(tail+1)%n;
return true;
}
/** Delete an element from the circular queue. Return true if the operation is successful. */
bool deQueue() {
if(isEmpty()){
return false;
}
head=(head+1)%n;
return true;
}
/** Get the front item from the queue. */
int Front() {
if(isEmpty())
return -1;
return item[head];
}
/** Get the last item from the queue. */
int Rear() {
if(isEmpty())
return -1;
if(tail-1<0){
return item[n-1];
}else{
return item[tail-1];
}
}
/** Checks whether the circular queue is empty or not. */
bool isEmpty() {
if(head==tail){
return true;
}else{
return false;
}
}
/** Checks whether the circular queue is full or not. */
bool isFull() {
if((tail+1)%n==head){
return true;
}else{
return false;
}
}
int *item;
int n;
int head,tail;
};
/**
* 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();
*/
执行用时 : 44 ms, 在Design Circular Queue的C++提交中击败了95.48% 的用户
内存消耗 : 16.7 MB, 在Design Circular Queue的C++提交中击败了48.42% 的用户