题目描述:使用队列实现如下操作:
push(x)-----元素x入栈
pop()-----移除栈顶元素
top()----获取栈顶元素
empty() -- --返回栈是否为空
题目分析:在python中,列表可以实现栈的功能,列表第一个元素是栈底元素,最后一个元素是栈顶元素。
编程语言:python
代码如下:
class MyStack:
def __init__(self):
"""
Initialize your data structure here.
"""
self.__list=[]
def push(self, x: int) -> None:
"""
Push element x onto stack.
"""
self.__list.append(x)
def pop(self) -> int:
"""
Removes the element on top of the stack and returns that element.
"""
if self.__list:
return self.__list.pop()
else:
return None
def top(self) -> int:
"""
Get the top element.
"""
if self.__list:
return self.__list[-1]
else:
return None
def empty(self) -> bool:
"""
Returns whether the stack is empty.
"""
if not self.__list:
return True
# 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()
leetcode提交结果: