24. 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.

题目分析

更换数据对，不能通过修改值，只能通过交换节点本身。

思路：
递归

Code

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode swapPairs(ListNode head) {
        if(head==null) return null;
        if(head.next==null) return head;
        ListNode tmp=head;
        tmp = tmp.next;
        ListNode tmp2=tmp.next;
        tmp.next=head;
        head.next=swapPairs(tmp2);
        return tmp;
    }

}