【LeetCode】 328. Odd Even Linked List 奇偶链表（Medium）（JAVA）每日一题

【LeetCode】 328. Odd Even Linked List 奇偶链表（Medium）（JAVA）

题目地址: https://leetcode.com/problems/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

Constraints:

• 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 …
• The length of the linked list is between [0, 10^4].

题目大意

给定一个单链表，把所有的奇数节点和偶数节点分别排在一起。请注意，这里的奇数节点和偶数节点指的是节点编号的奇偶性，而不是节点的值的奇偶性。

请尝试使用原地算法完成。你的算法的空间复杂度应为 O(1)，时间复杂度应为 O(nodes)，nodes 为节点总数。

解题方法

1. 这类题目只要分别用两个链表存储即可，最后把两个链表拼接起来
2. 为了不需要判断 null, 可以用新建一个链表头

class Solution {
    public ListNode oddEvenList(ListNode head) {
        ListNode res = new ListNode();
        ListNode odd = res;
        ListNode evenHead = new ListNode();
        ListNode even = evenHead;
        boolean flag = true;
        while (head != null) {
            if (flag) {
                odd.next = head;
                odd = head;
                head = head.next;
                odd.next = null;
            } else {
                even.next = head;
                even = head;
                head = head.next;
                even.next = null;
            }
            flag = !flag;
        }
        odd.next = evenHead.next;
        return res.next;
    }
}

执行用时：0 ms, 在所有 Java 提交中击败了 100.00% 的用户
内存消耗：38.2 MB, 在所有 Java 提交中击败了 83.47% 的用户

欢迎关注我的公众号，LeetCode 每日一题更新