# 如何仅用递归函数和栈操作逆序一个栈
def getAndRemoveLastElement(stack):
'''将栈stack的栈底元素返回并移除'''
result = stack.pop()
if not stack:
return result
else:
last = getAndRemoveLastElement(stack)
stack.append(result)
return last
def reverse(stack):
'''逆序一个栈'''
if not stack:
return
else:
i = getAndRemoveLastElement(stack)
reverse(stack)
stack.append(i)
if __name__ == '__main__':
stack = [1, 2, 3, 4, 5]
reverse(stack)
print(stack)
