844真题
1.顺序存储
typedef struct
{
ElemType data[MaxSize];
int length;
}SqList;
void Reverse(SqList &L)
{
ElemType t;
for(i=0;i<L.length/2;i++)
{
t=L.data[i];
L.data[i]=L.data[L.length-i+1];
L.data[L.length-i+1]=t;
}
}
2.链式存储
typedef struct LNode
{
ElemType data;
struct LNode *next;
}LNode,*LinkList;
LinkList Reverse(LinkList &L)
{
LNode *q=L->next;*p=L->next,*r;
if(p==NULL)
return L;
p->next=NULL;
p=p->next;
while(p!=NULL)
{
r=p;
p=p->next;
r->next=q;
q=r;
}
L->next=q;
return L;
}