-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueueExample.java
More file actions
74 lines (59 loc) · 1.72 KB
/
Copy pathqueueExample.java
File metadata and controls
74 lines (59 loc) · 1.72 KB
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
public class queueExample {
public static void main(String[] args) {
queue myQueue = new queue(5);
myQueue.enqueue(1);
myQueue.enqueue(2);
myQueue.enqueue(3);
myQueue.enqueue(4);
myQueue.enqueue(5);
// myQueue.enqueue(6);
myQueue.dequeue();
boolean isemptycheck = myQueue.isEmpty();
if(isemptycheck){
System.out.println("Queue is Empty..");
}
System.out.println("Elements in the queue:");
for (int i = myQueue.front; i <= myQueue.rear; i++)
System.out.print(myQueue.arr[i] + " ");
System.out.println();
}
static class queue {
int arr[];
int front;
int rear;
int size;
// contructor
queue(int size) {
this.size = size;
this.front = 0;
this.rear = -1;
this.arr = new int[size];
}
// enqueue operation
public void enqueue(int data) {
if (rear == size - 1) {
System.out.println("Queue is full , you cannot add more elements," + data + " not insert");
} else {
rear++;
arr[rear] = data;
}
}
// dequeue operation
public void dequeue() {
if (front > rear) {
System.out.println("Queue is Empty");
} else {
int del = arr[front];
front++;
System.out.println("Deleted element is: " + del);
}
}
// is empty
public boolean isEmpty() {
if (rear == -1){
return true;
}
return false;
}
}
}