-
Notifications
You must be signed in to change notification settings - Fork 0
/
DesignCircularQueue.cpp
84 lines (77 loc) · 2.07 KB
/
DesignCircularQueue.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
class MyCircularQueue {
public:
/** Initialize your data structure here. Set the size of the queue to be k. */
struct node{
int val;
node *next;
}*last=NULL;
int count=0;
int c;
MyCircularQueue(int k) {
c=k;
}
/** Insert an element into the circular queue. Return true if the operation is successful. */
bool enQueue(int value) {
if(count>=c) return false;
if(last==NULL){
node *temp=new node;
temp->val=value;
last=temp;
last->next=last;
}
else{
node *temp=new node;
temp->val=value;
temp->next=last->next;
last->next=temp;
last=temp;
}
count++;
return true;
}
/** Delete an element from the circular queue. Return true if the operation is successful. */
bool deQueue() {
if(last==NULL) return false;
if(last->next==last){
delete(last);
last=NULL;
}
else{
node *head=last->next;
last->next=head->next;
delete(head);
}
count--;
return true;
}
/** Get the front item from the queue. */
int Front() {
if(last==NULL) return -1;
return last->next->val;
}
/** Get the last item from the queue. */
int Rear() {
if(last==NULL) return -1;
return last->val;
}
/** Checks whether the circular queue is empty or not. */
bool isEmpty() {
if(count==0) return true;
return false;
}
/** Checks whether the circular queue is full or not. */
bool isFull() {
if(count==c) return true;
return false;
}
};
/**
* 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();
*/