FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Leetcode/algorithms/ImplementStackUsingQueues.js at master · superman06/Leetcode · GitHub
superman06
/
Leetcode
Public
forked from
dnshi/Leetcode
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Leetcode
/
algorithms
/
ImplementStackUsingQueues.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
70 lines (64 loc) · 1.7 KB
Breadcrumbs
Leetcode
/
algorithms
/
ImplementStackUsingQueues.js
Copy path
File metadata and controls
70 lines (64 loc) · 1.7 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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
// Source : https://leetcode.com/problems/implement-stack-using-queues/
// Author : Dean Shi
// Date : 2015-06-13
/**********************************************************************************
*
* Implement the following operations of a stack using queues.
*
* push(x) -- Push element x onto stack.
*
* pop() -- Removes the element on top of the stack.
*
* top() -- Get the top element.
*
* empty() -- Return whether the stack is empty.
*
* Notes:
*
* You must use only standard operations of a queue -- which means only push to back,
* peek/pop from front, size, and is empty operations are valid.
*
* Depending on your language, queue may not be supported natively. You may simulate
* a queue by using a list or deque (double-ended queue), as long as you use only
* standard operations of a queue.
*
* You may assume that all operations are valid (for example, no pop or top operations
* will be called on an empty stack).
*
* Update (2015-06-11):
* The class name of the Java function had been updated to MyStack instead of Stack.
*
* Credits:Special thanks to @jianchao.li.fighter for adding this problem and all test cases.
*
**********************************************************************************/
/**
*
@constructor
*/
var
Stack
=
function
(
)
{
this
.
stack
=
[
]
;
}
;
/**
*
@param
{
number
} x
*
@returns
{
void
}
*/
Stack
.
prototype
.
push
=
function
(
x
)
{
this
.
stack
.
push
(
x
)
;
}
;
/**
*
@returns
{
void
}
*/
Stack
.
prototype
.
pop
=
function
(
)
{
this
.
stack
.
pop
(
)
;
}
;
/**
*
@returns
{
number
}
*/
Stack
.
prototype
.
top
=
function
(
)
{
return
this
.
stack
[
this
.
stack
.
length
-
1
]
;
}
;
/**
*
@returns
{
boolean
}
*/
Stack
.
prototype
.
empty
=
function
(
)
{
return
!
this
.
stack
.
length
;
}
;
Back
|
FazBrowse Home
|
New Git URL