328 Odd Even Linked List

最新推荐文章于 2024-11-08 23:27:36 发布

air1tmac

最新推荐文章于 2024-11-08 23:27:36 发布

阅读量139

点赞数 1

分类专栏：笔记文章标签： leetcode

本文链接：https://blog.csdn.net/air1tmac/article/details/50907590

版权

笔记专栏收录该内容

13 篇文章 0 订阅

订阅专栏

原题描述

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 …

分析

先记下第一个偶数节点的位置，从第一个节点开始对每个节点进行操作，使其后继节点变为原后继节点的后继节点，即node->next=node->next->next。然后将最后一个奇数节点指向第一个偶数节点。

代码示例

class Solution {
public:
    ListNode* oddEvenList(ListNode* head) 
    {
        if(head == NULL)
            return head;
        ListNode* second = head -> next;
        ListNode* node = head;
        ListNode* temp = NULL;
        int count = 1;
        while (node -> next != NULL) 
        {
            temp = node;
            node = node -> next;
            temp -> next = temp -> next -> next;
            count++;

        }
        if(count % 2 != 0)
            node -> next = second;
        else
        {
            temp -> next = second;
        }
        return head;
    }
};