-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueueUsingArrays.java
More file actions
61 lines (53 loc) · 1.33 KB
/
Copy pathQueueUsingArrays.java
File metadata and controls
61 lines (53 loc) · 1.33 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
public class QueueUsingArrays{
static class Queue{
static int arr[];
static int size;
static int rear;
Queue(int n){
arr = new int[n];
size = n;
rear = -1;
}
public boolean isEmpty(){
return rear == -1;
}
public void add(int data){
if(rear == size-1){
System.out.println("Queue is full");
return;
}
rear = rear+1;
arr[rear] = data;
}
public int remove(){
// TC of this remove code is O(N)
if(isEmpty()){
System.out.println("Queue is empty");
return -1;
}
int front = arr[0];
for(int i=0; i<rear; i++){
arr[i] = arr[i+1];
}
rear = rear-1;
return front;
}
public int peek(){
if(isEmpty()){
System.out.println("Queue is empty");
return-1;
}
return arr[0];
}
}
public static void main(String args[]){
Queue q = new Queue(3);
q.add(4);
q.add(5);
q.add(6);
while(!q.isEmpty()){
System.out.println(q.peek());
q.remove();
}
}
}