来个大神帮忙看下这个链表倒置哪里有问题啊 真的看傻了

Question

void bear_reverse(node * front)
{
node *p, *c, *n;
p = NULL;
c = front;
n = c->next;

while (n != NULL)
{
    p = c;
    c = n;
    n = c->next;
    if (p != NULL)
    {
        p->next = c;
    }
}
c->next = p;

front = c;
}

Answer 1

 node * reverse(node * L)//单链表的倒置算法
{
     node  *p,*q;
     p=L->next;
     L->next=NULL;
     while(p)
     {
         q=p;
         p=p->next;
         q->next=L->next;
         L->next=q;
     }
     return L;
}