LeetCode: 328. Odd Even Linked List

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 …

解题思路

1. 用头插法生成奇数的逆序链表和偶数的逆序链表
2. 用头插法按顺序将偶数链表和奇数链表插入新的链表中

AC 代码

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func oddEvenList(head *ListNode) *ListNode {
    var odd, even *ListNode
    
    // split odd and even
    iter := head
    cur  := head
    for i := 1; iter != nil; i++ {
        cur := iter
        iter = iter.Next
        
        if i % 2 == 1 {
            cur.Next = odd
            odd = cur
        } else {
            cur.Next = even
            even = cur
        }
    }
    
    // link odd and even
    var newList *ListNode
    for even != nil {
        cur = even
        even = even.Next
        
        cur.Next = newList
        newList = cur
    }
    for odd != nil {
        cur = odd
        odd = odd.Next
        
        cur.Next = newList
        newList = cur
    }
    
    return newList
}