zoukankan      html  css  js  c++  java
  • 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 ...

    Credits:
    Special thanks to @DjangoUnchained for adding this problem and creating all test cases.

    Subscribe to see which companies asked this question

     简单的链表问题,将位置小标为奇数的节点和偶数的节点分别链接成两个链表,再将两个链表首尾相连即可。

    /**
     * Definition for singly-linked list.
     * struct ListNode {
     *     int val;
     *     ListNode *next;
     *     ListNode(int x) : val(x), next(NULL) {}
     * };
     */
    class Solution {
    public:
        ListNode *oddEvenList(ListNode *head){
            if(!head||!head->next)
                return head;
            ListNode *odd = head;
            ListNode *even = head->next;
            ListNode *even_head=even;
            while(even&&even->next){
                odd->next=even->next;
                odd=odd->next;
                even->next=odd->next;
                even=even->next;
            }
            odd->next=even_head;
            return head;
        }
    };
     
  • 相关阅读:
    野心和实力的磨合
    tpm
    菜猫学习linux笔记(1)
    调试理解过程
    TSS学习记录
    RSA加密算法理解(整理自网络)
    *args和**kwargs在python中的作用
    在 Ubuntu 16.04 中安装谷歌 Chrome 浏览器
    ubuntu安装微信客户端
    ubuntu 桌面操作系统安装WPS办公软件的方法
  • 原文地址:https://www.cnblogs.com/zhoudayang/p/5247833.html
Copyright © 2011-2022 走看看