[LeetCode]88. Swap Nodes in Pairs链表成对逆序

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        if (head == NULL || head->next == NULL) return head;
        ListNode* help = new ListNode(0);
        help->next = head;
        ListNode *first = help, *second = head, *third = head->next;
        while (third != NULL) {
            ListNode* tmp = third->next;
            third->next = first->next; // 调整一对节点
            first->next = third;
            second->next = tmp;
            if (tmp == NULL) break;
            first = second; // 前移到下一对节点
            second = tmp;
            third = tmp->next;
        }
        return help->next;
    }
};