-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinearQueue.java
57 lines (47 loc) · 1.07 KB
/
LinearQueue.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
public class LinearQueue {
Object arr[];
int size;
int rear = -1;
LinearQueue(int size) {
arr = new Object[size];
this.size = size;
}
boolean isEmpty() {
return rear == -1;
}
void add(Object data) {
if (rear == size - 1) {
System.out.println("Full Queue");
return;
}
rear++;
arr[rear] = data;
}
Object remove() {
if (isEmpty())
return -1;
Object front = arr[0];
for (int i = 0; i < rear; i++)
arr[i] = arr[i + 1];
rear--;
return front;
}
Object peek() {
if (isEmpty())
return -1;
return arr[0];
}
void display() {
while (!isEmpty()) {
System.out.println(peek());
remove();
}
}
public static void main(String[] args) {
var queue = new LinearQueue(5);
queue.add(1);
queue.add(2);
queue.add(3);
queue.display();
}
}