[LeetCode] 328. Odd Even Linked List

Invoker 發(fā)布于2019-08-16 14:28 / 2173人閱讀

Problem

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 ...

Solution

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

云服務(wù)器 GPU云服務(wù)器 Even linked Odd python odd

文章版權(quán)歸作者所有，未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請注明本文地址：http://www.ezyhdfw.cn/yun/73017.html

相關(guān)文章

leetcode 328. Odd Even Linked List

摘要：最后將奇數(shù)鏈表尾連到偶數(shù)鏈表頭即可。改進(jìn)的思路在于減少額外的變量創(chuàng)建。奇數(shù)指針的初始值為，而偶數(shù)指針的初始值為。則下一個奇數(shù)值位于上，此時將該奇數(shù)指針移動到上之后，偶數(shù)指針的值則為。題目要求 Given a singly linked list, group all odd nodes together followed by the even nodes. Please note...

Vultr 2019-08-15 14:47 評論0 收藏0
LeetCode 328：奇偶鏈表 Odd Even Linked List

摘要：給定一個單鏈表，把所有的奇數(shù)節(jié)點(diǎn)和偶數(shù)節(jié)點(diǎn)分別排在一起。鏈表的第一個節(jié)點(diǎn)視為奇數(shù)節(jié)點(diǎn)，第二個節(jié)點(diǎn)視為偶數(shù)節(jié)點(diǎn)，以此類推。需要記錄偶數(shù)位節(jié)點(diǎn)的第一個節(jié)點(diǎn)，因?yàn)檫@是偶數(shù)鏈表的頭節(jié)點(diǎn)，最后拼接鏈表時要用奇數(shù)鏈表的尾節(jié)點(diǎn)連接該節(jié)點(diǎn)。 ?給定一個單鏈表，把所有的奇數(shù)節(jié)點(diǎn)和偶數(shù)節(jié)點(diǎn)分別排在一起。請注意，這里的奇數(shù)節(jié)點(diǎn)和偶數(shù)節(jié)點(diǎn)指的是節(jié)點(diǎn)編號的奇偶性，而不是節(jié)點(diǎn)的值的奇偶性。請嘗試使用原地算法完成...

yeooo 2019-08-16 18:38 評論0 收藏0
LeetCode 328：奇偶鏈表 Odd Even Linked List

摘要：給定一個單鏈表，把所有的奇數(shù)節(jié)點(diǎn)和偶數(shù)節(jié)點(diǎn)分別排在一起。鏈表的第一個節(jié)點(diǎn)視為奇數(shù)節(jié)點(diǎn)，第二個節(jié)點(diǎn)視為偶數(shù)節(jié)點(diǎn)，以此類推。需要記錄偶數(shù)位節(jié)點(diǎn)的第一個節(jié)點(diǎn)，因?yàn)檫@是偶數(shù)鏈表的頭節(jié)點(diǎn)，最后拼接鏈表時要用奇數(shù)鏈表的尾節(jié)點(diǎn)連接該節(jié)點(diǎn)。 ?給定一個單鏈表，把所有的奇數(shù)節(jié)點(diǎn)和偶數(shù)節(jié)點(diǎn)分別排在一起。請注意，這里的奇數(shù)節(jié)點(diǎn)和偶數(shù)節(jié)點(diǎn)指的是節(jié)點(diǎn)編號的奇偶性，而不是節(jié)點(diǎn)的值的奇偶性。請嘗試使用原地算法完成...

flybywind 2019-07-31 11:29 評論0 收藏0
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 notthe value in the nodes.You should try to do it in plac...

abson 2019-07-31 10:19 評論0 收藏0
[LeetCode/LintCode] Odd Even Linked List

Problem 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. Example Example:Given...

awokezhou 2019-08-16 12:44 評論0 收藏0