题解 | #Zero-complexity
Zero-complexity Transposition
https://www.nowcoder.com/practice/c54775799f634c72b447ef31eb36e975
#include "cstdio"
using namespace std;
int main() {
int n;
scanf("%d", &n);
long long int arr[n];
for (int i = 0; i < n; ++i) {
scanf("%d", &arr[i]);
}
// 倒着输出一次即可
for (int i = n - 1; i >= 0; --i) {
printf("%d ", arr[i]);
}
return 0;
}
投递旷视等公司10个岗位 >