-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathMyQueue.java
More file actions
82 lines (67 loc) · 1.78 KB
/
Copy pathMyQueue.java
File metadata and controls
82 lines (67 loc) · 1.78 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
//Java program for array implementation of queue
package dataStructure;
//A class to represent a queue
class Queue{
int front, rear, size;
int capacity;
int array[];
public Queue(int capacity) {
this.capacity = capacity;
front = this.size = 0;
rear = capacity - 1;
array = new int[this.capacity];
}
//Queue is full when size becomes equal to capacity
boolean isFull(Queue queue) {
return(queue.size == queue.capacity);
}
//Queue is Empty when size is 0
boolean isEmpty(Queue queue){
return(queue.size == 0);
}
//Method to add an item to the queue
//It changes rear and size
void enqueue(int item) {
if(isFull(this))
return;
this.rear = (this.rear+1)%this.capacity;
this.array[this.rear] = item;
this.size = this.size+1;
System.out.println(item + " enqueud to queue");
}
//Method to remove an item from queue
//It changes front and size
int dequeue() {
if(isEmpty(this))
return Integer.MIN_VALUE;
int item = this.array[this.front];
this.front = (this.front + 1) % this.capacity;
this.size = this.size-1;
return item;
}
//Method to get front of queue
int front() {
if(isEmpty(this))
return Integer.MIN_VALUE;
return this.array[this.front];
}
//Method to get rear of queue
int rear() {
if(isEmpty(this))
return Integer.MIN_VALUE;
return this.array[this.rear];
}
}
//Driver Class
public class MyQueue{
public static void main(String[] args){
Queue queue = new Queue(1000);
queue.enqueue(10);
queue.enqueue(20);
queue.enqueue(30);
queue.enqueue(40);
System.out.println(queue.dequeue()+(" dequeued from queue"));
System.out.println("Front item is " + queue.front());
System.out.println("Rear item is "+ queue.rear());
}
}