#栈
class SequenceStack:
def _init_(self):
self.maxSize=100
self.s=[None for x in range(0,self.maxSize)]
self.top=-1
def push(self,x):
if self.top==self.maxSize-1:
print("栈满")
else:
self.top=self.top+1
self.s[self.top]=x
def isEmpty(self):
if self.top==-1:
return True
else:
return False
def pop(self):
if self.isEmpty()==True:
print("栈为空")
return
else:
x=self.s[self.top]
self.top=self.top-1
return x
def getTop(self):
if self.isEmpty()==True:
print("栈为空")
return
else:
return self.s[self.top]
ss=SequenceStack()
ss.push(1)
ss.push(2)
ss.push(3)
while ss.isEmpty()==False:
x=ss.pop()
print(x,end="")