[LeetCode/LintCode] Odd Even Linked List

awokezhou 發(fā)布于2019-08-16 12:44 / 1153人閱讀

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 1->2->3->4->5->NULL,
return 1->3->5->2->4->NULL.

Solution

public class Solution {
    /**
     * @param head: a singly linked list
     * @return: Modified linked list
     */
    public ListNode oddEvenList(ListNode head) {
        if (head != null) {
        //odd and even as two pointers, head and evenHead as two heads
            ListNode odd = head;
            ListNode even = head.next;
            ListNode evenHead = head.next;
            while (even != null && even.next != null) {
                odd.next = even.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)允許請(qǐng)勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請(qǐng)注明本文地址：http://m.hztianpu.com/yun/71608.html

相關(guān)文章

leetcode 328. Odd Even Linked List

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

Vultr 2019-08-15 14:47 評(píng)論0 收藏0
[LeetCode] 328. 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. You should try to do ...

Invoker 2019-08-16 14:28 評(píng)論0 收藏0
LeetCode 328：奇偶鏈表 Odd Even Linked List

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

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

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

flybywind 2019-07-31 11:29 評(píng)論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 評(píng)論0 收藏0