/
CircularDeque.java
92 lines (79 loc) · 2.03 KB
/
CircularDeque.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
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
90
91
92
// https://leetcode.com/problems/design-circular-deque/
// Looks same as normal circular queue
class MyCircularDeque {
private int[] deque;
private int size, maxSize, front, rear;
public MyCircularDeque(int k) {
deque = new int[k];
size = 0;
maxSize = k;
front = 0;
rear = k - 1;
}
public boolean insertFront(int value) {
if (isFull()) {
return false;
}
// Important thing to notice
front = (maxSize + front - 1) % maxSize;
deque[front] = value;
size++;
return true;
}
public boolean insertLast(int value) {
if (isFull()) {
return false;
}
rear = (rear + 1) % maxSize;
deque[rear] = value;
size++;
return true;
}
public boolean deleteFront() {
if (isEmpty()) {
return false;
}
front = (front + 1) % maxSize;
size--;
return true;
}
public boolean deleteLast() {
if (isEmpty()) {
return false;
}
// Important thing to notice
rear = (maxSize + rear - 1) % maxSize;
size--;
return true;
}
public int getFront() {
if (isEmpty()) {
return -1;
}
return deque[front];
}
public int getRear() {
if (isEmpty()) {
return -1;
}
return deque[rear];
}
public boolean isEmpty() {
return size == 0;
}
public boolean isFull() {
return size == maxSize;
}
}
/**
* Your MyCircularDeque object will be instantiated and called as such:
* MyCircularDeque obj = new MyCircularDeque(k);
* boolean param_1 = obj.insertFront(value);
* boolean param_2 = obj.insertLast(value);
* boolean param_3 = obj.deleteFront();
* boolean param_4 = obj.deleteLast();
* int param_5 = obj.getFront();
* int param_6 = obj.getRear();
* boolean param_7 = obj.isEmpty();
* boolean param_8 = obj.isFull();
*/