反转一个链表

typedef struct Node{
    int num;
    struct Node *next;
}Node,*pNode;

pNode ReverseAList(pNode listin)
{
    pNode nodePre = listin, nodeSuf = listin;
    pNode nodeMid = nodeSuf;
    nodeMid = nodePre->next;
    nodeSuf = nodeMid->next;
    nodePre->next = NULL;

    while (nodeSuf != NULL)
    {
        nodeMid->next = nodePre;
        nodePre = nodeMid;
        nodeMid = nodeSuf;
        nodeSuf = nodeSuf->next;
    }
    nodeMid->next = nodePre;

    return nodeMid;
}