【Leetcode】24. Swap Nodes in Pairs

题目地址：

https://leetcode.com/problems/swap-nodes-in-pairs/

给定一个链表，每两个交换链表节点。

代码如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
 public:
  ListNode* swapPairs(ListNode* head) {
    if (!head || !head->next) return head;

    auto dummy = new ListNode(0);
    dummy->next = head;
    for (auto cur = dummy; cur && cur->next; cur = cur->next->next) {
      if (auto tmp = cur->next->next; tmp) {
        cur->next->next = tmp->next;
        tmp->next = cur->next;
        cur->next = tmp;
      }
    }

    return dummy->next;
  }
};

时间复杂度$O(n)$，空间$O(1)$。