[leetcode] 225. Implement Stack using Queues
2022. 11. 30. 17:18ㆍ노트/Algorithm : 알고리즘
Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).
Implement the MyStack class:
- void push(int x) Pushes element x to the top of the stack.
- int pop() Removes the element on the top of the stack and returns it.
- int top() Returns the element on the top of the stack.
- boolean empty() Returns true if the stack is empty, false otherwise.
Notes:
- You must use only standard operations of a queue, which means that only push to back, peek/pop from front, size and is empty operations are valid.
- Depending on your language, the queue may not be supported natively. You may simulate a queue using a list or deque (double-ended queue) as long as you use only a queue's standard operations.
Example 1:
Input
["MyStack", "push", "push", "top", "pop", "empty"]
[[], [1], [2], [], [], []]
Output
[null, null, null, 2, 2, false]
Explanation
MyStack myStack = new MyStack();
myStack.push(1);
myStack.push(2);
myStack.top(); // return 2
myStack.pop(); // return 2
myStack.empty(); // return False
Constraints:
- 1 <= x <= 9
- At most 100 calls will be made to push, pop, top, and empty.
- All the calls to pop and top are valid.
class MyStack(object):
def __init__(self):
self.q = collections.deque()
def push(self, x):
"""
:type x: int
:rtype: None
"""
self.q.append(x)
for _ in range(len(self.q) - 1):
self.q.append(self.q.popleft())
def pop(self):
"""
:rtype: int
"""
return self.q.popleft()
def top(self):
"""
:rtype: int
"""
return self.q[0]
def empty(self):
"""
:rtype: bool
"""
return len(self.q) == 0
# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()
'노트 > Algorithm : 알고리즘' 카테고리의 다른 글
[leetcode] 641. Design Circular Deque (0) | 2022.12.06 |
---|---|
[leetcode] 622. Design Circular Queue (0) | 2022.12.01 |
[leetcode] 232. Implement Queue using Stacks (0) | 2022.11.30 |
[leetcode] 739. Daily Temperatures (0) | 2022.11.28 |
[leetcode] 316. Remove Duplicate Letters (0) | 2022.11.24 |