//设计一个高效的算法,将顺序表的所有元素逆置,要求算法的空间复杂度为O(1)。
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#define N 5
typedef struct
{
int * data;
int length;
int MaxSize;
}Seqlist;
void InitSeqlist(Seqlist &L)
{
L.MaxSize = 100;
L.data = (int*)malloc(L.MaxSize*sizeof(int));
L.length = 0;
}
void Reverse_Sq(Seqlist &L)
{
int tmp;
for (int i = 0; i < L.length / 2; i++)
{
tmp = L.data[i];
L.data[i]= L.data[L.length-i-1];
L.data[L.length - i - 1] = tmp;
}
}
int main()
{
Seqlist L;
InitSeqlist(L);
printf("请输入顺序表里数据:\n");
for (int i = 0; i < N; i++)
{
scanf("%d",&L.data[i]);
L.length++;
}
Reverse_Sq(L);
printf("请输出顺序表里数据:\n");
for (int i = 0; i < N; i++)
{
printf("%d ", L.data[i]);
}
system("pause");
return 0;
}
运行结果: