王道数据结构顺序表2--逆置

问题

逆置线性表

//逆置线性表
#include<bits/stdc++.h>
using namespace std;
#define Max 50
struct SqList{
	int a[Max] = {1,2,3,4,5,6,7,8};
	int length = 8;
};
void reserve(SqList &L)
{
	for(int i = 0;i < L.length/2; i++)
	{
		int t = L.a[i];
		L.a[i] = L.a[L.length-1-i];
		L.a[L.length-1-i] = t;
	}
}
int main()
{
	SqList L;
	reserve(L);
	for(int i = 0;i < L.length;i++)
	{
		cout<<L.a[i]<<" ";
	}
	cout<<endl;
	return 0;
}

没有借助线性表的逆置
//逆置
#include<bits/stdc++.h>
using namespace std;
#define NUM 20
int main(){
	int a[NUM];
	int length=0;
	cout<<"请输入一串数据，以-1为结束标志："<<endl;
	while(1){
		cin>>a[length];
		length++;
		if(a[length-1]==-1||length>NUM) break;
	}
	length=length-1;//把没用的-1去掉
	for(int i=0;i<length;i++){
		cout<<a[i]<<" ";
	} 
	cout<<endl;
	for(int i=0;i<length/2;i++){
		swap(a[i],a[length-1-i]);
	}
	for(int i=0;i<length;i++){
		cout<<a[i]<<" ";
	}
	cout<<endl;
	return 0;
}