Implement Stack using Queues LeetCode solution in Python

1
class MyStack(object):
2

3
    def __init__(self):
4
        self.stack = []
5

6
    def push(self, x):
7
        self.stack.append(x)
8
        return None
9

10
    def pop(self):
11
        return self.stack.pop(-1)
12

13
    def top(self):
14
        return self.stack[-1]
15

16
    def empty(self):
17
        if self.stack == []:
18
            return True
19
        return False
20

21

22
# Your MyStack object will be instantiated and called as such:
23
# obj = MyStack()
24
# obj.push(x)
25
# param_2 = obj.pop()
26
# param_3 = obj.top()
27
# param_4 = obj.empty()