题解 | #Zero-complexity
Zero-complexity Transposition
https://www.nowcoder.com/practice/c54775799f634c72b447ef31eb36e975
#include <bits/stdc++.h>
using namespace std;
stack<long long> s;
int main(){
int n;
while(cin >> n){
for(int i = 0;i < n;i ++){
long long number;
cin >> number;
s.push(number);
}
while(!s.empty()){
cout << s.top() << " ";
s.pop();
}
}
return 0;
}
查看10道真题和解析
