利用Python实现顺序栈

class stack:
def __init__(self, maxsize):
self.max = maxsize
self.elem = [None] * self.max
self.top = 0
self.base = 0
def push(self,elem):
if self.top - self.base == self.max:
raise Exception("The stack is full!")
self.elem[self.top] = elem
self.top += 1
def pop(self):
if self.top == self.base:
raise Exception("The stack is empty")
self.top -= 1
e = self.elem[self.top]
return e
def get_top(self):
return self.elem[self.top - 1]
data = list(map(int,input("Please input a series of datas:").split(" ")))
s = stack(len(data))
for i in range(len(data)):
s.push(data[i])
for i in range(s.top - s.base):
print(s.elem[i],end=" ")
print("\n")
e = s.get_top()
print("The top elem of the stack is: %d" % e)
print("\n")
for i in range(s.top - s.base):
s.pop()
print("After popping the stack %d times,the stack is:" % (i + 1),end=" ")
for j in range(s.top - s.base):
print(s.elem[j],end=" ")
print("\n")