-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue.cpp
86 lines (71 loc) · 1.44 KB
/
Queue.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
85
86
#include <iostream>
#define DIM 100
using namespace std;
template <class H> class Queue{
private:
int n;
H *v;
int front, rear;
bool _isFull(){
return n==DIM ? true : false;
}
bool _isEmpty(){
return n==0 ? true : false;
}
public:
Queue(){
v=new H(DIM);
n=0;
front=rear=0;
}
int getN() const{
return n;
}
Queue<H>* enqueue(H x){
if(!_isFull()){
v[rear]=x;
rear=(rear+1)%DIM;
n++;
return this;
}
cout<<"Queue Overflow"<<endl;
return this;
}
Queue<H>* dequeue(){
if(!_isEmpty()){
front=(front+1)%DIM;
n--;
return this;
}
cout<<"Queue Underflow"<<endl;
return this;
}
void print(){
if(!_isEmpty()){
int i=front;
while(i!=rear){
cout<<v[i]<<" ";
i=(i+1)%DIM;
}
}
cout<<endl;
}
void clear(){
front=0;
rear=0;
n=0;
}
};
int main(){
Queue<int>* q=new Queue<int>();
q->enqueue(2)->enqueue(3)->enqueue(12)->enqueue(4)->enqueue(9)->enqueue(5);
q->dequeue()->dequeue();
q->print();
q->enqueue(2)->enqueue(3);
q->print();
q->enqueue(5)->enqueue(8)->enqueue(10)->enqueue(4)->enqueue(9)->enqueue(3)->print();
q->dequeue()->dequeue()->dequeue()->enqueue(8)->enqueue(10)->enqueue(11)->dequeue()->dequeue()->enqueue(20)->dequeue()->print();
cout<<q->getN()<<endl;
q->clear();
q->print();
}