-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathW4_Queue(Array).cpp
106 lines (95 loc) · 1.84 KB
/
W4_Queue(Array).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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
//Created by dongwan-kim on 2022/04/14.
#include<iostream>
#include<string>
using namespace std;
int n;
class Queue{
public:
int queuesize;
int arr[10000];
int frontIdx;
int rearIdx;
Queue(){
arr[10000]={};
queuesize=0;
frontIdx=0;
rearIdx=0;
}
void updateidx(){
frontIdx %= n;
rearIdx %= n;
}
bool isEmpty(){
if(queuesize==0)
return true;
else
return false;
}
void size(){
cout<<queuesize<<endl;
}
void front(){
if(isEmpty())
cout<<"Empty"<<endl;
else
cout<<arr[frontIdx]<<endl;
}
void rear(){
if(isEmpty())
cout<<"Empty"<<endl;
else
cout<<arr[rearIdx-1]<<endl;
}
void enqueue(int v){
if(queuesize>=n)
cout<<"Full"<<endl;
else{
arr[rearIdx]=v;
rearIdx++;
updateidx();
queuesize++;
}
}
void dequeue(){
if(isEmpty())
cout<<"Empty"<<endl;
else{
cout<<arr[frontIdx]<<endl;
frontIdx++;
updateidx();
queuesize--;
}
}
};
int main(){
int t;
cin>>n>>t;
Queue q;
while(t--){
string cmd;
cin>>cmd;
if(cmd=="isEmpty"){
if(q.isEmpty())
cout<<"True"<<endl;
else
cout<<"False"<<endl;
}
else if(cmd=="size"){
q.size();
}
else if(cmd=="enqueue"){
int a;
cin>>a;
q.enqueue(a);
}
else if(cmd=="dequeue"){
q.dequeue();
}
else if(cmd=="front"){
q.front();
}
else if(cmd=="rear"){
q.rear();
}
}
}