Leetcode题解 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.

用两个链表来分别存奇数位和偶数位的值，代码不够优雅，随后参考别人的实现！

/**
 * 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||head.next==null) return head;
        ListNode firstHead=new ListNode(1);
        ListNode secondHead=new ListNode(1);
        ListNode temp1=firstHead;
        ListNode temp2=secondHead;
        boolean flag=true;
        while(head!=null){
            if(flag){
                temp1.next=head;
                temp1=temp1.next;
            }else{
                temp2.next=head;
                temp2=temp2.next;
            }
            head=head.next;
            flag=!flag;
        }
        firstHead=firstHead.next;
        secondHead=secondHead.next;
        flag=true;
        temp1.next=null;
        temp2.next=null;
        ListNode result=new ListNode(-1);
        ListNode temp=result;
        while(firstHead!=null&&secondHead!=null){
            if(flag){
                temp.next=secondHead;
                secondHead=secondHead.next;
            }else{
                temp.next=firstHead;
                firstHead=firstHead.next;
            }
            temp=temp.next;
            flag=!flag;
        }
        if(firstHead!=null){
            temp.next=firstHead;
        }else if(secondHead!=null){
            temp.next=secondHead;
        }else{
            temp.next=null;
        }
        return result.next;
    }
}