-
Notifications
You must be signed in to change notification settings - Fork 30
Expand file tree
/
Copy pathNo225.implement-stack-using-queues.js
More file actions
87 lines (80 loc) · 2 KB
/
Copy pathNo225.implement-stack-using-queues.js
File metadata and controls
87 lines (80 loc) · 2 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
85
86
87
/**
* Difficulty:
* Easy
*
* Desc:
* 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).
*/
var Node = function(val, next) {
this.val = val || null;
this.next = next || null;
};
/**
* Initialize your data structure here.
*/
var MyStack = function() {
this.head = null;
this.tail = null;
this.size = 0;
};
/**
* Push element x onto stack.
* @param {number} x
* @return {void}
*/
MyStack.prototype.push = function(x) {
var node = new Node(x);
if (!this.head) {
this.head = node;
this.tail = node;
} else {
node.next = this.head;
this.head = node;
}
this.size += 1;
};
/**
* Removes the element on top of the stack and returns that element.
* @return {number}
*/
MyStack.prototype.pop = function() {
if (!this.head) {
return null;
}
var node = this.head;
this.head = this.head.next;
if (!this.head) this.tail = null;
this.size -= 1;
return node.val;
};
/**
* Get the top element.
* @return {number}
*/
MyStack.prototype.top = function() {
return this.head.val;
};
/**
* Returns whether the stack is empty.
* @return {boolean}
*/
MyStack.prototype.empty = function() {
return this.size === 0;
};
/**
* Your MyStack object will be instantiated and called as such:
* var obj = Object.create(MyStack).createNew()
* obj.push(x)
* var param_2 = obj.pop()
* var param_3 = obj.top()
* var param_4 = obj.empty()
*/