Leetcode 题解 - 链表-(10)-链表元素按奇偶聚集

[LeetCode] 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 ...

Credits:
Special thanks to @aadarshjajodia for adding this problem and creating all test cases.

 

这道题给了我们一个链表，让我们分开奇偶节点，所有奇节点在前，偶节点在后。我们可以使用两个指针来做，head指向奇节点，next指向偶节点，然后把偶节点next后面的那个奇节点提前到head的后面，然后head和next各自前进一步，此时next又指向偶节点，head指向当前奇节点的末尾，以此类推直至把所有的偶节点都提前了即可，参见代码如下：

/**
 * 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 index = head, next = head.next, last = head.next;
        while(next != null && next.next != null ){//如果下个链表或者再下个节点没有就不用排序了
            head.next = next.next;
            next.next = next.next.next; //要建立两个额外的链表 因为一次
            //衔接需要用到四个点， 这是关键
            head = head.next;
            next = next.next;           
        }
        head.next = last;
        return index;

    }
}

第二次写

/**
 * 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 index = head, next = head.next, node = head.next;;
        while(next != null && next.next != null){
            head.next = next.next;
            next.next = head.next.next;
            head = head.next;
            next = next.next;
        }
        head.next = node;
        return index;
        
    }
}