-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.cpp
148 lines (137 loc) · 2.66 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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
#include<iostream>
using namespace std;
struct node
{
string info;
node * next;
};
class queue
{
node * head;
node * rear;
node * temp;
int size;
int length;
public:
queue(int = 7);
~queue();
void enqueue(string);
void dequeue();
bool isfull();
bool isempty();
string peek();
};
int main()
{
int no_queues , no_people , op;
string person_name;
cout << "How many Queues? ";
cin >> no_queues;
queue * que = new queue[no_queues];
while (1)
{
cout << "Choose:" << endl << endl;
cout << "0. To Exit" << endl;
cout << "1. Enqueue Person" << endl;
cout << "2. Dequeue Person" << endl;
cout << "Choose: ";
cin >> op;
if(op == 0)
break;
if(op > 2 && op < 1)
{
cout << "Invalid Input!" << endl;
continue;
}
if(op == 1)
{
for(int i = 0; i < no_queues; i++)
{
if(!(que+i)->isfull())
{
cout << "Enter Person's Name: ";
cin >> person_name;
(que + i)->enqueue(person_name);
cout << person_name << " got in the Line!" << endl;
break;
}
if(no_queues = i + 1)
{
cout << "Seems, every Line is Full!" << endl;
}
}
}
else
{
if(!(que)->isempty())
{
cout << que->peek() << " got his ticket!" << endl;
(que)->dequeue();
for(int i = 0 ; i < no_queues - 1 ; i++)
{
if((que + i + 1)->isempty())
break;
(que + i)->enqueue((que + i + 1)->peek());
(que + i + 1)->dequeue();
}
}
else
{
cout << "Noone in the Line!" << endl;
}
}
}
return 0;
}
queue::queue(int size)
{
head = rear = NULL;
this->size = size;
length = 0;
}
queue::~queue()
{
while(head != NULL)
dequeue();
}
void queue::enqueue(string name)
{
rear = new node;
rear->info = name;
rear->next = NULL;
if(head == NULL)
head = rear;
length++;
}
void queue::dequeue()
{
temp = head;
head = head->next;
delete temp;
temp = NULL;
if(head == NULL)
rear = NULL;
length--;
}
bool queue::isfull()
{
if(length == size)
return true;
return false;
}
bool queue::isempty()
{
if(length == 0)
return true;
return false;
}
string queue::peek()
{
if(isempty())
{
cout << "Nothing in Queue" << endl;
return 0;
}
string ret = head->info;
return ret;
}