leetcode第23题 - 链表节点两两置换

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.

递归方式 
交换p 和 p.next 结点 
swapHead = p.next 
swapHead.next = p

代码如下：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    /**
     * @param head a ListNode
     * @return a ListNode
     */
    public ListNode swapPairs(ListNode head) {
        // Write your code here
        ListNode p = head;
        if(p==null || p.next==null)
            return p;
        ListNode pNextNext = p.next.next;
        ListNode swapHead = p.next; // 交换p 和 p.next 两个结点
        swapHead.next = p; // 进行交换
        ListNode swapNextNext = swapPairs(pNextNext); // 递归
        p.next = swapNextNext;
        return swapHead;
    }
}