Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
34 lines (30 loc) · 823 Bytes

File metadata and controls

34 lines (30 loc) · 823 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
// implementation of Queue using 2 stacks
// contribution made by hamza chabchoub for a university project
class Queue {
constructor() {
this.inputStack = []
this.outputStack = []
}
// Push item into the inputstack
enqueue(item) {
this.inputStack.push(item)
}
dequeue() {
// push all items to outputstack
this.outputStack = []
while (this.inputStack.length > 0) {
this.outputStack.push(this.inputStack.pop())
}
// return the top element of the outputstack if any
if (this.outputStack.length > 0) {
const top = this.outputStack.pop()
// repush all the items to the inputstack
this.inputStack = []
while (this.outputStack.length > 0) {
this.inputStack.push(this.outputStack.pop())
}
return top
}
}
}
export { Queue }
Morty Proxy This is a proxified and sanitized view of the page, visit original site.