-
Notifications
You must be signed in to change notification settings - Fork 31.1k
Expand file tree
/
Copy pathDeque.js
More file actions
106 lines (95 loc) · 2.15 KB
/
Copy pathDeque.js
File metadata and controls
106 lines (95 loc) · 2.15 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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
import LinkedList from '../linked-list/LinkedList';
export default class Deque {
constructor() {
// We use a doubly linked list internally so that both front and back
// operations run in O(1) time.
this.linkedList = new LinkedList();
}
/**
* Check if the deque is empty.
* @return {boolean}
*/
isEmpty() {
return !this.linkedList.head;
}
/**
* Read the element at the front of the deque without removing it.
* @return {*}
*/
peekFront() {
if (!this.linkedList.head) {
return null;
}
return this.linkedList.head.value;
}
/**
* Read the element at the back of the deque without removing it.
* @return {*}
*/
peekBack() {
if (!this.linkedList.tail) {
return null;
}
return this.linkedList.tail.value;
}
/**
* Add a new element to the front (head) of the deque.
* @param {*} value
*/
addFront(value) {
this.linkedList.prepend(value);
}
/**
* Add a new element to the back (tail) of the deque.
* @param {*} value
*/
addBack(value) {
this.linkedList.append(value);
}
/**
* Remove the element from the front (head) of the deque.
* @return {*}
*/
removeFront() {
const removedHead = this.linkedList.deleteHead();
return removedHead ? removedHead.value : null;
}
/**
* Remove the element from the back (tail) of the deque.
* @return {*}
*/
removeBack() {
const removedTail = this.linkedList.deleteTail();
return removedTail ? removedTail.value : null;
}
/**
* Return the number of elements in the deque.
* @return {number}
*/
get size() {
let count = 0;
let currentNode = this.linkedList.head;
while (currentNode) {
count += 1;
currentNode = currentNode.next;
}
return count;
}
/**
* Convert the deque to an array (front to back).
* @return {*[]}
*/
toArray() {
return this.linkedList
.toArray()
.map((linkedListNode) => linkedListNode.value);
}
/**
* Return a string representation of the deque.
* @param {function} [callback]
* @return {string}
*/
toString(callback) {
return this.linkedList.toString(callback);
}
}