Swap Nodes in Pairs(反转链表相邻两个节点)leetcode24

Given a linked list, swap every two adjacent nodes and return its head.

Example:

Given 1->2->3->4->5->6, you should return the list as 2->1->4->3->6->5.

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.

下面代码思路：先处理前两个节点，后面节点再依次处理；

code：

public ListNode swapPairs(ListNode head) {
        if(head==null||head.next==null)
            return head;
        ListNode result=head.next;
         ListNode node=head.next;
            head.next=node.next;
            node.next=head;
        while(head.next!=null){
           node=head.next;
            if(node.next!=null){
                head.next=node.next;
                node.next=head.next.next;
                head.next.next=node;
                head=node;
            }else{
                break;
            }
        }
        return result;
    }