[Leetcode] Swap Nodes in Pairs

题目：

Given a linked list, swap every two adjacent nodes and return its head.

For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.

Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.

思路：遍历过程中swap，注意判断最后剩一个元素的情况。

class Solution {
public:
    ListNode *swapPairs(ListNode *head) {
        if (head == nullptr || head->next == nullptr) return head;
        ListNode* front = head->next;
        ListNode* back = head;
        ListNode* new_head = head->next;
        while (front != nullptr) {
            ListNode* temp = front->next;
            front->next = back;
            front = temp == nullptr ? nullptr : temp->next;
            if (temp != nullptr && temp->next == nullptr) {   //one node left
                back->next = temp;
            } else {   //0 or ≥2 nodes left
                back->next = front;
            }
            back = temp;
        }
        return new_head;
    }
};

总结：时间复杂度O(n).