24.两两交换链表结点

/**
 * 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) {
   
        ListNode *l1=new ListNode(0),*l2=head;
        l1->next = l2;
        ListNode *res = l1;
        if(l1->next == NULL || l2->next == NULL)
            return head;
        
        while(l2 != NULL && l2->next != NULL)
        {
            l1->next = l2->next;  // 0 --> 2
            l2->next = l1->next->next;  // 1 --> 3
            l1->next->next = l2;  // 2 --> 1
            l1 = l2;
            l2 = l2->next;            
        }        
        return res->next;  
    }
};