-
Notifications
You must be signed in to change notification settings - Fork 0
/
QueueVoronov.java
212 lines (198 loc) · 3.46 KB
/
QueueVoronov.java
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
import java.util.*;
import java.util.Stack;
public class QueueVoronov {
ArrayList<Integer> list;
public QueueVoronov()
{
list=new ArrayList<>();
}
// Adds a number to queue
public void enqueue(Integer num)
{
list.add(num);
}
// Removes a number from queue
public Integer dequeue() {
return list.remove(0);
}
// Converts toString
public String toString()
{
String s="";
Queue copy=new Queue();
boolean b=false;
while(!b)
{
try {
int num =this.dequeue();
copy.enqueue(num);
s=s+" "+num;
}
catch(Exception e)
{
b=true;
}
}
restore(copy);
return s;
}
// Gets maximum element in queue and returns it
public int getMax()
{
Queue copy=new Queue();
boolean b=false;
int max=0;
while(!b)
{
try {
int num=this.dequeue();
if(num>max)
max=num;
copy.enqueue(num);
}
catch(Exception e)
{
b=true;
}
}
restore(copy);
return max;
}
public void restore(Queue q)
{
boolean b=false;
while(!b)
{
try
{
this.enqueue(q.dequeue());
}
catch(Exception e)
{
b=true;
}
}
}
// Finds minimum element in the queue and returns it
// Similar to getMax method
public Integer getMin()
{
Queue copy=new Queue();
boolean b=false;
int min=Integer.MAX_VALUE;
while(!b)
{
try {
int num=this.dequeue();
if(num<min)
min=num;
copy.enqueue(num);
}
catch(Exception e)
{
b=true;
}
}
restore(copy);
return min;
}
// Reverses the queue
public void reverseOrder()
{
Stack<Integer> s =new Stack<>();
boolean b=false;
while(!b)
{
try {
s.push(this.dequeue());
}
catch(Exception e)
{
b=true;
}
}
b=false;
while(!b)
{
try
{
this.enqueue(s.pop());
}
catch(Exception e)
{
b=true;
}
}
}
// Finds the average of all the elements in the queue
public double getAverage()
{
int sum=0,cnt=0;
double average=0.0;
Queue copy=new Queue();
boolean b=false;
while(!b)
{
try {
int temp = this.dequeue();
copy.enqueue(temp);
sum+=temp;
cnt++;
}
catch(Exception e)
{
b=true;
}
}
restore(copy);
average=(double)sum/cnt;
return average;
}
// Checks if sorted. Returns t/f depending on sort state
public boolean isSorted()
{
Queue q=new Queue();
boolean b=false;
boolean sorted=true;
while(!b)
{
try
{
Integer n1=this.dequeue();
Integer n2=this.dequeue();
q.enqueue(n1);
q.enqueue(n2);
if(n1>n2)
sorted = false;
}
catch(Exception e)
{
b=true;
}
}
restore(q);
return sorted;
}
}
class Driver
{
public static void main(String[] args)
{
Queue m = new Queue();
m.enqueue(10);
m.enqueue(12);
m.enqueue(15);
m.enqueue(7);
m.enqueue(100);
m.enqueue(22);
System.out.println("The queue is : " + m);
m.reverseOrder();
System.out.println("The queue in the reverse order is: "+ m);
m.reverseOrder();
System.out.printf("Average = %.2f\n", m.getAverage());
System.out.println(m);
System.out.println("Max = " + m.getMax());
System.out.println("Max = " + m.getMin());
System.out.println("The list is sorted: "+ m.isSorted());
}
}