考研 线性表 元素逆序 时间复杂度O(1)

#include <bits/stdc++.h>
#include<stdio.h>
#define MaxSize 1000
using namespace std;

typedef int ElemType;
typedef struct {
    ElemType data[MaxSize];
    ElemType length;
 }SqList;


void InitList(SqList *&L){
	
	L = (SqList*)malloc(sizeof(SqList)*MaxSize);
	L->length = 10;
}

int Length(SqList *L){
	
	return L->length;
}

void PrintList(SqList* L){
	
	for(int i = 0; i < L->length; i++)
		printf("%d  ",L->data[i]);
}

void Reverse(SqList* &L){

	ElemType temp;
	for(int i = 0; i < (L->length)/2 ;i++){
		temp = L->data[i];
       		L->data[i] = L->data[L->length - i];
        	L->data[L->length - i] = temp;
	}
}

int main(){
	
	SqList* L;
	InitList(L);
	printf("输入十个元素:\n");
	for(int i = 0; i < 10 ; i++)
		scanf("%d",&L->data[i]);
	printf("逆序前:\n");
        PrintList(L);
        printf("\n");
        printf("逆序后:\n");
        PrintList(L);
}