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

    详见:https://leetcode.com/problems/odd-even-linked-list/description/

    C++:

    /**
     * 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 *pre=head;
            ListNode *cur=head->next;
            while(cur&&cur->next)
            {
                ListNode *tmp=pre->next;
                pre->next=cur->next;
                cur->next=cur->next->next;
                pre->next->next=tmp;
                cur=cur->next;
                pre=pre->next;
            }
            return head;
        }
    };
    

     参考:https://www.cnblogs.com/grandyang/p/5138936.html

  • 相关阅读:
    转 MySQL权限管理
    mysql 驱动问题
    mysql issue:
    (五)容器网络 -上
    idea 快速生成代码的快捷键
    (四)容器互联
    (三)将容器变成镜像
    (二)docker的部署安装,配置,基础命令
    (一)为什么要学习docker
    Centos7 安装docker ce
  • 原文地址:https://www.cnblogs.com/xidian2014/p/8832908.html
Copyright © 2011-2022 走看看