Leetcode24

Swap Nodes in Pairs:
Given a linked list, swap every two adjacent nodes and return its head.
Example:
Given 1->2->3->4, you should return the list as 2->1->4->3.
Note:
Your algorithm should use only constant extra space.
You may not modify the values in the list’s nodes, only nodes itself may be changed.

Solution:

#include <iostream>

using namespace std;

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {

        ListNode* dummyNode = new ListNode(0);
        dummyNode->next = head;

        ListNode* p = dummyNode;
        while ( p->next && p->next->next ){

            ListNode* node1 = p->next;
            ListNode* node2 = node1->next;
            ListNode* next = node2->next;

            node1->next = next;
            node2->next = node1;
            p->next = node2;

            p = node1;

        }

        ListNode* retNode = dummyNode->next;
        delete dummyNode;

        return retNode;

    }
};

总结： 遇到链表的题一定要自己动手画一画，这样思路就出来了，不要忘记虚拟头结点的设计。