题目描述
设计一个高效算法,将顺序表L的所有元素逆置,要求算法的空间复杂度为O(1)。
即不要开辟新的数组空间。
#include<iostream>
using namespace std;
#define Maxsize 1000
typedef struct
{
int data[Maxsize];
int length;
}sqList;
void reverse(sqList& L)
{
for (int i = 0; i < L.length /2; i++)
{
int temp = L.data[i];
L.data[i] = L.data[L.length - 1 - i];
L.data[L.length - 1 - i] = temp;
}
}
int main()
{
sqList L = { {1,2,3,4,5,6},6 };
cout << "init seq:";
for (int i = 0; i < L.length; i++)
cout << L.data[i] << " ";
cout << endl;
cout << "reversed seq:";
reverse(L);
for (int i = 0; i < L.length; i++)
cout << L.data[i] << " ";
return 0;
}