Question

单链表的存储结构 typedef struct LNode{ ElemType data; struct LNode *next; }LNode,*LinkList;

单链表的存储结构

typedef struct LNode{

ElemType data;

struct LNode *next;

}LNode,*LinkList;

将带头结点的单链表L就地逆置，即要求利用原结点空间将其逆置

Answer 1

void reverse(LNode *L)
{
LNode *p=NULL, *n, *pre;
pre = L->next;
if (pre != NULL)
{
p = pre->next;
pre->next = NULL;
}
while (p != NULL)
{
n = p->next;
p->next = pre;
pre = p;
p = n;
}
if (pre != NULL)
{
L->next = pre;
}
}