题目:设计一个高效算法,将顺序表L的所有元素逆置,要求算法的空间复杂度为O(1)
核心代码:
temp=L.data[i];
L.data[i]=L.data[L.length-1-i];
L.data[L.length-1-i]=temp;
代码:
int temp=0;
void reverse(SqList &L){
for(int i=0;i<L.length/2;i++){
temp=L.data[i];
L.data[i]=L.data[L.length-1-i];
L.data[L.length-1-i]=temp;
}
}
能运行的代码:
# include<iostream>
using namespace std;
#define MaxSize 11
typedef struct {
int data[MaxSize];
int length;
}SqList;
int temp=0;
void reverse(SqList &L){
for(int i=0;i<L.length/2;i++){
temp=L.data[i];
L.data[i]=L.data[L.length-1-i];
L.data[L.length-1-i]=temp;
}
}
void InitList(SqList &L){
L.length=0;
for(int i=0;i<MaxSize;i++)
{
cin>>L.data[i];
L.length++;
}
}
void print(SqList L){
for(int i=0;i<L.length;i++){
cout<<L.data[i]<<" ";
}
}
int main(){
SqList L;
InitList(L);
cout<<"sequence list:";
print(L);
cout<<endl;
cout<<"reversing sequence list:";
reverse(L);
print(L);
system("pause");
return 0;
}
谢谢观看哦~ 点个赞吧~