-
Notifications
You must be signed in to change notification settings - Fork 1
/
queue.js
156 lines (119 loc) · 2.27 KB
/
queue.js
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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
//////////////////////////////////////queue using list///////////////////////////////////////////////////
class Node {
constructor(data) {
this.data = data
this.next = null
}
}
class qList {
constructor() {
this.head = null
this.tail = null
this.size = 0
}
enqueue(data) {
const nodeData = new Node(data)
if (this.head == null) {
this.head = nodeData
this.tail = nodeData
} else {
this.tail.next = nodeData
this.tail = nodeData
}
this.size++
}
dequeue() {
this.head = this.head.next
this.size--
}
isEmpty() {
return this.size === 0
}
getSize() {
return this.size
}
print() {
let curr = this.head
while (curr) {
console.log(curr.data);
curr = curr.next
}
}
peek() {
return this.head.data
}
}
const listQ = new qList()
listQ.enqueue(10)
listQ.enqueue(12)
listQ.enqueue(13)
listQ.dequeue()
console.log(listQ.isEmpty());
console.log(listQ.getSize(), 'size');
console.log(listQ.peek(), 'peek');
listQ.print()
////////////////////////////////////////queue using object///////////////////////////////////////////////////
class queueObj {
constructor() {
this.items = {}
this.front = 0
this.back = 0
}
enqueue(val) {
this.items[this.back] = val
this.back++
}
dequeue() {
delete this.items[this.front]
this.front++
}
print() {
console.log(this.items);
}
}
const que = new queueObj()
que.enqueue(1)
que.enqueue(2)
que.enqueue(3)
que.dequeue()
console.log(que.size());
que.print()
//////////////////////////////////////////////////////////////queue using array///////////////////////////////
class Queue {
constructor() {
this.items = []
}
enqueue(val) {
this.items.push(val)
}
dequeue() {
return this.items.shift()
}
isEmpty() {
return this.items.length === 0
}
size() {
return this.items.length
}
print() {
console.log(this.items);
}
reverse() {
if (this.size() === 0) {
return
}
let frontElement = this.dequeue()
this.reverse()
this.enqueue(frontElement)
}
}
const q = new Queue()
q.enqueue(1)
q.enqueue(2)
q.enqueue(3)
q.dequeue()
console.log('emty?', q.isEmpty());
console.log('size:', q.size());
q.print()
q.reverse()
q.print()