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 …
• 地址

问题分析

• 做法类似于LeetCode 86. Partition List，同样是分成两部分（虚拟出两条链表），同样是保持原来顺序（从前到后遍历），同样是 in place 。

代码实现

• 自己

/**
 * 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 || head.next.next == null) {
            return head;
        }
        ListNode oddHead = head;
        ListNode oddTail = oddHead;
        ListNode evenHead = head.next;
        ListNode evenTail = evenHead;
        ListNode curNode = head.next.next;
        boolean isOdd = true;
        while (curNode != null) {
            if (isOdd) {
                oddTail.next = curNode;
                oddTail = curNode;
            }else {
                evenTail.next = curNode;
                evenTail = curNode;
            }
            isOdd = ! isOdd;
            curNode = curNode.next;
        }
        oddTail.next = evenHead;
        evenTail.next = null;
        return head;
    }
}

• LeetCode Solution

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