Question

数据结构中有试写一算法,实现顺序表的就地逆置

Answer 1

链表吗

node*reverse(node*head)

{

node*p1,*p2,*p3;

if(head==NULL||head->next==NULL)

return head;

p1=head;p2=p1->next;

while(p2)

{

p3=p2->next;

p2->next=p1;

p1=p2;

p2=p3;

}

head->next=NULL;

head=p1;

return head;

}