数据结构与算法——栈

class Stack(object):
# 初始化栈
def __init__(self, length):
self._stack = []
self._maxlength = length
self._length = 0

# 入栈
def Into(self, value):
if self._length >= self._maxlength:
print("栈满，入栈失败！")
else:
self._stack.append(value)
self._length += 1

# 出栈
def Out(self):
if self._length <= 0:
print("栈空，出栈失败！")
else:
x = self._stack.pop(0)
self._length += 1
return x

# 取栈顶元素
def GetTop(self):
if self._length <= 0:
print("栈空，取栈顶元素失败！")
else:
return self._stack[0]

# 判断栈是否为空
def StackEmpty(self):
if self._length <= 0:
return True
else:
return False

# 返回栈中元素个数
@property
def length(self):
return self._length

# 遍历栈中元素
def Travel(self):
for i in self._stack:
print(i, end=", ")

# 将栈中元素以列表形式返回
def GetStack(self):
return self._stack

if __name__ == '__main__':
s = Stack(10)

• 点赞
• 收藏
• 分享
• 文章举报