-
Notifications
You must be signed in to change notification settings - Fork 26
Expand file tree
/
Copy pathQueue.java
More file actions
70 lines (58 loc) · 1.32 KB
/
Queue.java
File metadata and controls
70 lines (58 loc) · 1.32 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
package Algorithms_Java;
import java.util.Arrays;
public class Queue {
int[] data;
int size;
int front;
public Queue(int capacity) {
this.data = new int[capacity];
this.size = 0;
this.front = 0;
}
public Queue() {
this(5);
}
public Queue(int[] arr) {
this.data=Arrays.copyOf(arr, arr.length);
this.size = arr.length;
this.front = 0;
}
public int size() {
return this.size;
}
public boolean isEmpty() {
return this.size == 0;
}
public void enQueue(int value) throws Exception{
if (this.size == this.data.length) {
throw new Exception("Queue is full");
}
int tail = (front + size) % this.data.length;
this.data[tail] = value;
this.size++;
}
public int deQueue() throws Exception{
if (isEmpty()) {
throw new Exception("Queue is empty");
}
int delval = this.data[this.front];
this.data[this.front] = 0;
this.front = (this.front + 1) % this.data.length;
this.size--;
return delval;
}
public int front() throws Exception{
if (isEmpty()) {
throw new Exception("Queue is empty");
}
return this.data[front];
}
public void display() {
for (int i = 0; i <this.size; i++) {
int temp= (i + this.front) % this.data.length;
System.out.print(this.data[temp] + "->");
}
System.out.println("Queue End");
System.out.println("----------------------------");
}
}