Odd Even Linked List问题及解法

最新推荐文章于 2023-12-09 08:53:54 发布

我们要爱学习

最新推荐文章于 2023-12-09 08:53:54 发布

阅读量389

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium

本文链接：https://blog.csdn.net/u011809767/article/details/77943902

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

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.

示例:
Given 1->2->3->4->5->NULL,
return 1->3->5->2->4->NULL.

问题分析：

利用双指针，分别记录奇偶索引的最后一个值得指针，然后进行删除和插入操作即可。

过程详见代码：

/**
 * 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 == nullptr) return nullptr;
		ListNode* odd = head,*even = head->next,* t,* h;
        if(!even) return head;
        h = even->next;
		while (h)
		{
				even->next = h->next;
				h->next = odd->next;
				odd->next = h;
				even = even->next;
                odd = odd->next;
				if (even) h = even->next;
				else break;
		}
		return  head;
    }
};