数据结构线性表的单链表的逆转流程，越详细越好，谢啦

void Inverse(LinkList &L)
/* 对带头结点的单链表L实现就地逆置 */
{
if (L->next != NULL) {
if (L->next->next == NULL) {
} else if (L->next->next->next == NULL) {
LNode *p ;
p=L->next;
L->next->next->next=L->next;
L->next=L->next->next;
p->next=NULL;

} else {
LNode *p, *q, *r;
p = L->next;
q = p->next;
r = q->next;
p->next = NULL;
while (r->next != NULL) {
q->next = p;
p = q;
q = r;
r = r->next;
}
q->next = p;
r->next = q;