FilesExpand file tree

 master

/

Implement Queue using Stacks.js

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

55 lines (48 loc) · 1.12 KB

 master

/

Implement Queue using Stacks.js

Copy path

Top

File metadata and controls

• Code
• Blame

55 lines (48 loc) · 1.12 KB

Raw

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

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

/*Implement the following operations of a queue using stacks.

push(x) -- Push element x to the back of queue.

pop() -- Removes the element from in front of queue.

peek() -- Get the front element.

empty() -- Return whether the queue is empty.*/

/**

* Initialize your data structure here.

*/

var MyQueue = function() {

this.q = []

};

/**

* Push element x to the back of queue.

* @param {number} x

* @return {void}

*/

MyQueue.prototype.push = function(x) {

this.q.unshift(x)

};

/**

* Removes the element from in front of queue and returns that element.

* @return {number}

*/

MyQueue.prototype.pop = function() {

return this.q.pop()

};

/**

* Get the front element.

* @return {number}

*/

MyQueue.prototype.peek = function() {

return this.q[this.q.length-1]

};

/**

* Returns whether the queue is empty.

* @return {boolean}

*/

MyQueue.prototype.empty = function() {

return this.q[0] == null

};

/**

* Your MyQueue object will be instantiated and called as such:

* var obj = Object.create(MyQueue).createNew()

* obj.push(x)

* var param_2 = obj.pop()

* var param_3 = obj.peek()

* var param_4 = obj.empty()

*/