leetcode刷题，总结，记录，备忘 328

最新推荐文章于 2024-06-05 18:14:23 发布

guicaisa

最新推荐文章于 2024-06-05 18:14:23 发布

阅读量1.5k

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/guicaisa/article/details/50557475

版权

leetcode 专栏收录该内容

128 篇文章 0 订阅

订阅专栏

这篇博客主要探讨LeetCode第328题——奇偶链表。题目要求将链表中所有奇数节点依次排列，接着是偶数节点，同时保持它们内部的相对顺序不变。解决方案需要在原地完成，要求空间复杂度为O(1)，时间复杂度为O(n)。文章将分享具体的解题思路和实现方法。

摘要由CSDN通过智能技术生成

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

题目中已经表明，第一个节点被默认为基数，第二个为偶数，奇偶交错排列，所以分别，取得第一个和第二个节点的指针，当作奇数和偶数的链表头，然后将每个奇数放入奇数链表，偶数放入偶数链表，最后连起来。

/**
 * 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 == NULL)
        {
            return NULL;
        }
        
        ListNode * odd = head;
        ListNode * even = head->next;
        ListNode * temp = even;
        
        while (even && even->next)
        {
            odd->next = even->next;
            odd = odd->next;
            even->next = odd->next;
            even = even->next;
        }
        
        odd->next = temp;
        return head;
    }
};