24. Swap Nodes in Pairs

Problem:

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.

题意是交换一个链表相邻的一对值。例子是1 -> 2 -> 3 -> 4交换后是2 -> 1 -> 4 -> 3。然后值得注意的是，假如是奇数个值的话，最后一个是不交换的。然后题目要求不能通过改变链表对应的值来解决问题，只能通过链表节点对应的位置。而且空间要是常数空间完成。

所以这题的做法就是一系列的链表结点的交换。

我的做法时间复杂度O(n)，空间复杂度O(1)。

Code:(LeetCode运行3ms)

/**
 * 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 *newhead = new ListNode(-1);
        newhead -> next = head;
        ListNode *prev = newhead, *position = head;
        while (position != NULL && position -> next != NULL) {
            prev -> next = position -> next;
            prev = prev -> next;
            position -> next = prev -> next;
            prev -> next = position;
            position = position -> next;
            prev = prev -> next;
        }
        return newhead -> next;
    }
};