-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueue.java
More file actions
89 lines (73 loc) · 1.58 KB
/
Queue.java
File metadata and controls
89 lines (73 loc) · 1.58 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
package ImplementingQueuesUsingArrays;
public class Queue {
int[] numbers = new int[3];
int indexHead = -1;
int indexTail = -1;
public void queueEnqueue(int data) {
if(indexHead == -1) {
indexHead +=1;
indexTail +=1;
numbers[indexHead] = data;
}
else {
if(indexTail == numbers.length - 1) {
System.out.println("Queue is full");
}
else {
indexTail +=1;
numbers[indexTail] = data;
//System.out.println(Arrays.toString(numbers));
}
}
}
public void queueDequeue() {
if(indexTail == -1) {
System.out.println("Queue is empty");
}
else {
for(int i = 0; i < indexTail; i ++) {
numbers[i] = numbers[i+1];
}
numbers[indexTail] = 0;
indexTail -=1;
if(indexTail == -1) {
indexHead = -1;
}
}
}
public int queueFindSize() {
if(indexTail == -1) {
return 0;
}
else {
return Math.abs(indexTail - indexHead) + 1;
}
}
public void queuePeek() {
if(indexTail == -1) {
System.out.println();
}
else {
System.out.println(numbers[indexHead]);
}
}
public void queuePrint(){
System.out.print("[");
//only one element inserted
if(indexTail ==-1) {
//do nothing
}else if(indexTail ==0) {
System.out.print(numbers[indexHead]);
}else {
for(int i = 0; i < indexTail + 1; i++) {
if( i != indexTail) {
System.out.print(" "+ numbers[i] + " , ");
}else {
System.out.print(numbers[i]+" ");
}
}
}
System.out.print("]");
System.out.println();
}
}