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 1:

Input: 1->2->3->4->5->NULL
Output: 1->3->5->2->4->NULL

Example 2:

Input: 2->1->3->5->6->4->7->NULL
Output: 2->3->6->7->1->5->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 ...

代码：

代码很简短，但是很巧妙。

想法很简单：拆分成两个链表，然后偶数节点组成的链表拼接在奇数节点链表的后面就可以了。

两个指针分别指向奇数节点和偶数节点，奇数节点的下一个节点改成当前偶数节点指向的节点的下一个节点，偶数节点的下一个节点指向当前奇数节点的下一个节点，一直这样向后指，关键在于循环终止条件的判断。如果写成odd !=null && even !=null这种，那么需要保存odd的前驱，不然如果odd最后指向null时，奇数节点最后一个节点就找不到了。而改成even != null && even.next != null这种写法就不需要保存前驱节点了，因为even.next==null就会判断退出，推出时odd正好指向奇数节点的最后一个节点。这样代码就可以大大简化了。

class Solution {
    public ListNode oddEvenList(ListNode head) {
        if(head == null || head.next == null)
            return head;
        ListNode odd = head;
        ListNode even = head.next;
        ListNode evenHead = even;
        while(even != null && even.next != null){
            odd = odd.next = even.next;
            even = even.next = odd.next;
        }
        odd.next = evenHead;
        return head;
    }
}