leetcode: 24. 两两交换链表中的节点

借用临时接节点

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* swapPairs(struct ListNode* head){
    if (head == NULL || head->next == NULL) return head;

    struct ListNode result;
    struct ListNode *node = &result;
    struct ListNode *next;
    struct ListNode *nnext;
    node->next = NULL;

    while (head && head->next) {
        struct ListNode *tmp = head;
        next = head->next;
        nnext = next->next;

        node->next = next;
        next->next = head;
        head->next = nnext;

        head = nnext;
        node = node->next->next;
    }

    return result.next;
}