题解 | #反转链表#

双指针：

• 遍历和反转

        ListNode* cur = pHead;
        ListNode* pre = NULL;
        ListNode* next = NULL;
        while (cur != NULL) {
            next = cur->next;
            cur->next = pre;
            pre = cur;
            cur = next;
        }