-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patha29Queue.java
More file actions
132 lines (125 loc) · 3.83 KB
/
a29Queue.java
File metadata and controls
132 lines (125 loc) · 3.83 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
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
public class a29Queue {
int rear , front;
int queue[];
int capacity;
int size;
public a29Queue(int capacity){
front = rear = -1;
size = 0;
this.capacity = capacity;
queue = new int[capacity];
}
public boolean isFull(){
if (rear==capacity-1) {
return true;
}
return false;
}
public boolean isEmpty(){
if (front==-1) {
return true;
}
return false;
}
public int peek(){
if (isEmpty()) {
System.out.println("Queue is Empty");
return -1;
}
return queue[front];
}
public void enqueue(int val){
if (isFull()) {
System.out.println("Queue is Full");
return;
}
if (isEmpty()) {
rear = front = 0;
}else{
rear++;
}
size++;
queue[rear] = val;
}
public int dequeue(){
if (isEmpty()) {
System.out.println("Queue is Empty");
return -1;
}
int val = queue[front];
if (front==rear) {
front = -1;
rear = -1;
}else{
front++;
}
size--;
return val;
}
public int size() {
return size;
}
public void printQueue(){
if (isEmpty()) {
System.out.println("Queue is Empty");
return;
}
for(int i = front; i<=rear; i++){
System.out.print(queue[i] + ",");
}
System.out.println();
}
public static void main(String[] args) {
a29Queue myQueue = new a29Queue(5);
System.out.println("Capacity is: "+5);
System.out.println("Print:");
myQueue.printQueue();
System.out.println("Insert element :"+7);
myQueue.enqueue(7);
System.out.println("Peak element: "+ myQueue.peek());
System.out.println("Insert element :"+8);
myQueue.enqueue(8);
System.out.println("Peak element: "+ myQueue.peek());
System.out.println("Insert element :"+9);
myQueue.enqueue(9);
System.out.println("Peak element: "+ myQueue.peek());
System.out.println("Insert element :"+11);
myQueue.enqueue(11);
System.out.println("Insert element :"+19);
myQueue.enqueue(19);
System.out.println("Insert element :"+9);
myQueue.enqueue(9);
System.out.println("is Queue full: "+ myQueue.isFull());
System.out.println("Print:");
myQueue.printQueue();
System.out.println("delete element");
myQueue.dequeue();
System.out.println("is Queue full: "+ myQueue.isFull());
System.out.println("Print:");
myQueue.printQueue();
System.out.println("Insert element :"+19);
myQueue.enqueue(19);
System.out.println("Print:");
myQueue.printQueue();
System.out.println("Peak element: "+ myQueue.peek());
System.out.println("delete element");
myQueue.dequeue();
System.out.println("Peak element: "+ myQueue.peek());
System.out.println("is Queue empty: "+ myQueue.isEmpty());
System.out.println("Print:");
myQueue.printQueue();
System.out.println("delete element");
myQueue.dequeue();
System.out.println("delete element");
myQueue.dequeue();
System.out.println("delete element");
myQueue.dequeue();
System.out.println("delete element");
myQueue.dequeue();
System.out.println("is Queue empty: "+ myQueue.isEmpty());
System.out.println("Print:");
myQueue.printQueue();
System.out.println("delete element");
myQueue.dequeue();
}
}