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

  • 相关阅读:
    第二周作业第1题——滕飞
    现代软件工程_第02周_第01题_纪梓潼
    计算机系统分类
    1,性能测试关键指标
    01,python变量
    2.7 生命周期各测试方法对比
    2.6 软件测试方法
    2.5 软件的开发文档和测试文档
    2.4 软件的开发模块
    2.3 软件的生命周期
  • 原文地址:https://www.cnblogs.com/xidian2014/p/8832908.html
Copyright © 2011-2022 走看看