通过这个题可以清楚的理解递归!
import sys
def dellast(nums):
re=nums.pop()
if not nums:
return re
else:
i=dellast(nums)
nums.append(re)
return i
def reverseStack(nums):
if not nums:
return
i=dellast(nums)
reverseStack(nums)
nums.append(i)
a=int(input())
nums=list(map(int,input().split()))
reverseStack(nums)
print(' '.join(map(str,nums)), end=' ')