逆置顺序表，空间复杂度为O(1)

//逆置顺序表，空间复杂度为O(1)
#include <stdio.h>
#define Max 50
struct SqList {
	int data[Max]{ 0,1,2,3,4,5,6,7,8,9 };
	int length = 10;
};

int PrintList(SqList L) {
	for (int i = 0; i < L.length; i++) {
		printf("%d", L.data[i]);
	}
	printf("\n");
	return 0;
}

int ExchangeList(SqList &L) {
	int temp;
	for (int i = 0; i <= L.length / 2; i++) {
		temp = L.data[L.length-i-1];
		L.data[L.length - i - 1] = L.data[i];
		L.data[i] = temp;
	}
	return 0;
}



int main() {
	SqList L;
	PrintList(L);
	ExchangeList(L);
	PrintList(L);
	return 0;
}