-
Notifications
You must be signed in to change notification settings - Fork 62
/
MyCircularDeque.java
89 lines (73 loc) · 1.71 KB
/
MyCircularDeque.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
package datastructure.queue.leetcode;
/**
* @author roseduan
* @time 2020/9/13 2:30 下午
* @description 设计循环双端队列
*/
class MyCircularDeque {
private int[] data;
private int size;
private int head;
private int tail;
public MyCircularDeque(int k) {
this.data = new int[k];
this.size = 0;
this.head = 0;
this.tail = 0;
}
public boolean insertFront(int value) {
if (size >= data.length) {
return false;
}
if (size != 0) {
head = head == 0 ? data.length - 1 : head - 1;
}
data[head] = value;
size++;
return true;
}
public boolean insertLast(int value) {
if (size >= data.length) {
return false;
}
if (size == 0) {
return insertFront(value);
}
tail = (tail + 1) % data.length;
data[tail] = value;
size++;
return true;
}
public boolean deleteFront() {
if (size == 0) {
return false;
}
if (size != 1) {
head = (head + 1) % data.length;
}
size--;
return true;
}
public boolean deleteLast() {
if (size == 0) {
return false;
}
if (size != 1) {
tail = (tail == 0) ? data.length - 1 : tail - 1;
}
size--;
return true;
}
public int getFront() {
return size == 0 ? -1 : data[head];
}
public int getRear() {
return size == 0 ? -1 : data[tail];
}
public boolean isEmpty() {
return this.size == 0;
}
public boolean isFull() {
return size == this.data.length;
}
}