328.LeetCode_Linked List_Odd Even Linked List

328. Odd Even Linked List

   

My Submissions

Question Editorial Solution

Total Accepted: 29029  Total Submissions: 76708  Difficulty: Medium

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 @DjangoUnchained for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

https://leetcode.com/problems/odd-even-linked-list/

一、题目描述：

输入一个LinkedList，输出按奇偶位置排序，奇数位置在前，偶数位置在后。

二、JavaCode

public class Solution {
    public ListNode oddEvenList(ListNode head) {
       if(head == null || head.next == null)
            return head;
        ListNode odd = new ListNode(0);
        //偶数循环节点
        ListNode oddCurr = odd; 
        ListNode even = new ListNode(0);
        //基数循环节点
        ListNode evenCurr = even;
        int count = 0;
        while(head != null) 
        {
            count ++;   
            if(count % 2 == 0) 
            {
                evenCurr.next = new ListNode(head.val);
                evenCurr = evenCurr.next;
            } 
            else
            {
                oddCurr.next = new ListNode(head.val);
                oddCurr = oddCurr.next;
            }
            head = head.next;
        }
        
        oddCurr.next = even.next;
        return odd.next;
    }
}