SCAU 8578 顺序表逆置奇技淫巧偷懒法

nidelvmaodiaole

已于 2024-06-14 12:39:59 修改

阅读量203

点赞数 2

文章标签： c++ 算法开发语言

于 2024-06-14 12:36:32 首次发布

本文链接：https://blog.csdn.net/nidelvmaodiaole/article/details/139678653

版权

输入样例

10
1 2 3 4 5 6 7 8 9 10

输出样例

The List is:1 2 3 4 5 6 7 8 9 10 
The turned List is:10 9 8 7 6 5 4 3 2 1

#include <iostream>
using namespace std;
int main() {
	int n;
	cin >> n;
	int* num = new int[n];
	cout << "The List is:";
	for (int i = 0; i < n; i++){
		cin >> num[i];
		cout << num[i] << " ";
	}
	cout << endl << "The turned List is:";
	for (int i = n - 1; i >= 0; i--)
		cout << num[i] << " ";
}