题目:数组中的数,按照逆序重新存放
逆序思路:即把一列数,倒着放,可以以中间元素为中心,将两侧元素互换
互换代码:
#include <stdio.h>
#define N 10
int main() {
for (int i = 0; i < N / 2; i++) {
tempt = a[i];
a[i] = a[N - i - 1];
a[N - i - 1] = tempt;
}
}
return 0;
全部代码:
int a[10];
int tempt = 0;
printf("Please input numbers!\n");
for (int i = 0; i < 10; i++)
scanf("%d", &a[i]);
for (int k = 0; k < 10; k++)
printf("%d", a[k]);
for (int i = 0; i < 5; i++) {
tempt = a[i];
a[i] = a[10 - i - 1];
a[10 - i - 1] = tempt;
}
printf("\n NOW \n");
for (int k = 0; k < 10; k++) {
printf("%d", a[k]);
}
输出: