题解 | #用递归函数和栈逆序一个栈#
用递归函数和栈逆序一个栈
https://www.nowcoder.com/practice/1de82c89cc0e43e9aa6ee8243f4dbefd
N = int(input())
X = list(map(int,input().split()))
mm = [X.pop() for i in range(0,len(X))]
def resort(n,x):
if len(x)-n < n-1:
x[len(x)-n],x[n-1] = x[n-1],x[len(x)-n]
resort(n-1,x)
return x
print(" ".join(map(str,resort(N,mm))))
