-
Notifications
You must be signed in to change notification settings - Fork 93
/
MyCircularQueue.java
62 lines (46 loc) · 1.24 KB
/
MyCircularQueue.java
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
//https://leetcode.com/problems/design-circular-queue/
class MyCircularQueue {
public int [] arr;
int front = 0,rear=-1;
int num_of_elem =0;
public MyCircularQueue(int k) {
arr = new int[k];
num_of_elem=k;
}
public boolean enQueue(int value) {
if(!isFull()){
rear = (rear+1)%num_of_elem;
arr[rear]=value;
return true;
}
else return false;
}
public boolean deQueue() {
if(!isEmpty()){
if(front == rear) {
rear =-1;front = 0;
}
else {
front =(front+1) %num_of_elem;
}
return true;
}
else return false;
}
public int Front() {
if(!isEmpty()) return arr[front];
else return -1;
}
public int Rear() {
if(!isEmpty()) return arr[rear];
else return -1;
}
public boolean isEmpty() {
if(rear == -1) return true;
else return false;
}
public boolean isFull() {
if(front == (rear+1)%num_of_elem && !isEmpty()) return true;
else return false;
}
}