LeetCode.328 Odd Even Linked List

题目：

Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.

Example:
Given 1->2->3->4->5->NULL,
return 1->3->5->2->4->NULL.

Note:
The relative order inside both the even and odd groups should remain as it was in the input. 
The first node is considered odd, the second node even and so on ...

分析：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode oddEvenList(ListNode head) {
        //给定链表，奇数位置节点在前面，偶数位置节点在后面
        //思路：将链表中奇数位置的节点全部拼接到链表末尾
        if(head==null||head.next==null)return head;
        
        ListNode dummy=new ListNode(0);
        ListNode pre=dummy;
        dummy.next=head;
        //记数标志位
        int count=0;
        
        ListNode temp=head;
        //尾结点
        ListNode tail=null;
        while(temp!=null){
            tail=temp;
            count++;
            temp=temp.next;
        }
        
        ListNode cur=head;
        //遍历插入节点
        for(int i=1;i<=count;i++){
            //防止cur为tail，则不需要拼接至末尾
            if(i%2==0&&cur.next!=null){
                //偶数位置
                pre.next=cur.next;
                //需要断链
                cur.next=null;
                tail.next=cur;
                tail=tail.next;
                cur=pre.next;
            }else{
                //奇数位置
                pre=pre.next;
                cur=cur.next;
            }        
        }
        return dummy.next;
    }
}

改进版：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode oddEvenList(ListNode head) {
        //给定链表，奇数位置节点在前面，偶数位置节点在后面
        //思路：将奇数位置串一串，偶数位置串一串，最后拼接
        if(head==null)return head;
        
        ListNode odd=head;
        ListNode even=odd.next,evenHead=even;
        
        while(even!=null&&even.next!=null){
            //直接替换
            odd.next=odd.next.next;
            even.next=even.next.next;
            odd=odd.next;
            even=even.next;
        }
        
        //将偶数串拼接奇数末尾
        odd.next=evenHead;
        return head;
        
    }
}