题解 | 神秘石像的镜像序列
神秘石像的镜像序列
https://www.nowcoder.com/practice/fa34eea974234610b6d3d81790cb2949
#include <stdio.h>
void reverse(int arr[], int size) {
for (int i = size - 1; i >= 0; i--) {
if (i != size - 1) {
printf(" ");
}
printf("%d", arr[i]);
}
printf("\n");
}
int main() {
int arr[100];
int n;
int i = 0;
while (scanf("%d", &n) && n != 0) {
arr[i++] = n;
}
reverse(arr, i);
return 0;
}
