单向链表逆序


思想:仅需改变每个节点的指向就行,并且保证每个节点都不丢失,所以用了三根指针来记录节点,p1指针用来指向(被指向节点),p2指针用来指向(指向节点),p3指针用来指向(丢失的节点)

具体实现看代码:

Node* ReList(Node* pHead)
{
    if(pHead == NULL)return NULL;          
    if(pHead->pNext == NULL)return pHead;
    Node *p1 = NULL;
    Node *p2 = NULL;
    Node *p3 = NULL;
    p2 = pHead;
    p3 = p2->pNext;
    while(p3 != NULL)
    {
        p2->pNext = p1;
        p1 = p2;
        p2 = p3;
        p3 = p3->pNext;
    }
    p2->pNext = p1;
    return p2;
}

猜你喜欢

转载自blog.csdn.net/weixin_42097765/article/details/81149420