Zero-complexity Transposition#
Zero-complexity Transposition
https://www.nowcoder.com/practice/c54775799f634c72b447ef31eb36e975
#include <iostream>
#include <stack>
using namespace std;
stack<int> stk;
int main() {
int n, num;
while (cin >> n) {
while (n --) {
cin >> num;
stk.push(num);
}
while (!stk.empty()) {
cout << stk.top() << ' ';
stk.pop();
}
cout << endl;
}
return 0;
}
查看17道真题和解析
