-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathimplement-queue-using-stacks.js
More file actions
84 lines (74 loc) · 1.5 KB
/
Copy pathimplement-queue-using-stacks.js
File metadata and controls
84 lines (74 loc) · 1.5 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
/**
* Source: https://leetcode.com/problems/implement-queue-using-stacks/
* Tags: [Stack,Design]
* Level: Easy
* Title: Implement Queue using Stacks
* Auther: @imcoddy
* Content: 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.
*
*
* Notes:
*
* You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid.
* Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
* You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).
*
*
*
*
* Subscribe to see which companies asked this question
*
*
*
*
*
*
*
*
*
*
*
*
* Show Similar Problems
*
*
* (E) Implement Stack using Queues
*/
/**
* @constructor
*/
var Queue = function() {
};
/**
* @param {number} x
* @returns {void}
*/
Queue.prototype.push = function(x) {
};
/**
* @returns {void}
*/
Queue.prototype.pop = function() {
};
/**
* @returns {number}
*/
Queue.prototype.peek = function() {
};
/**
* @returns {boolean}
*/
Queue.prototype.empty = function() {
};