非递归逆置:
void reverse_list(node **head)
{
node *p, *q, *r;
p = *head;
q = p->next;
while(q!=NULL)
{
r = q->next;
q->next = p;
p = q;
q = r;
}
(*head)->next = NULL;
*head = p;
}
非递归逆置:
void reverse_list(node **head)
{
node *p, *q, *r;
p = *head;
q = p->next;
while(q!=NULL)
{
r = q->next;
q->next = p;
p = q;
q = r;
}
(*head)->next = NULL;
*head = p;
}