1.原解:
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int cnt = n;
int* p = (int*)malloc(sizeof(int) * n);
while (cnt>= 1)
{
cin >> p[cnt - 1];
cnt--;
}
for (int i = 0; i < n; i++)
{
cout << p[i];
if (n == n - 1)
cout << endl;
else
cout << " ";
}
return 0;
}
2.改进题解:
C++ 的algorithm库里面有reverse 函数:
//头文件
#include <algorithm>
//使用方法
reverse(a, a+n);//n为数组中的元素个数
改进:
#include<iostream>
#include<algorithm>
using namespace std;
#define N 100
int main()
{
int n;
cin >> n;
int p[N];
for (int i = 0; i < n; i++) cin >> p[i];
reverse(p, p + n);
for (int i = 0; i < n; i++)
{
cout << p[i];
cout << ((i == n - 1) ? "\n" : " ");
}
return 0;
}