题解 | #Zero-complexity Tran...#
Zero-complexity Transposition
https://www.nowcoder.com/practice/c54775799f634c72b447ef31eb36e975
#include <iostream>
#include<stack>
using namespace std;
int main() {
stack<long long> stack1;
int Number = 0;
while (scanf("%d", &Number) !=
EOF) { //此处必须写上“!=EOF”，否则会超时！
for (int i = 0; i < Number; i++) {
long long number;
scanf("%lld", &number);
stack1.push(number);
}
for (int i = 0; i < Number; i++) {
printf("%lld ", stack1.top()); //先读顶部元素
stack1.pop();//再出栈
}
printf("\n");
}
}
以我的经历，我的带教有十几年工作经验，做过运维、后端开发、web测试，现在是高级软测，是行走的避坑指南
查看16道真题和解析