LeetCode | 328. Odd Even Linked List

1LOVESJohnny

于 2019-02-03 20:06:39 发布

阅读量163

点赞数

分类专栏： LeetCode 文章标签： linked list 链表 LeetCode

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/86760843

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

题外话：

即将春节，感觉怎么都睡不够，预祝大家春节快乐！

题目：

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 1:

Input: 1->2->3->4->5->NULL
Output: 1->3->5->2->4->NULL

Example 2:

Input: 2->1->3->5->6->4->7->NULL

Output: 2->3->6->7->1->5->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 ...

题意及解题思路：

本题要求将输入的链表顺序调整为奇数坐标的链表连接偶数坐标的链表，即：用no.1表示第1个链表节点，no.t表示第t个链表节点，输入顺序为no.1 -> no.2 -> no.3 -> no.4 -> no.5 -> NULL 要求输出顺序为no.1 -> no.3 -> no.5 -> no.2 -> no.4 -> NULL。

在草稿纸上模拟样例的处理过程，则有了以下代码思路。题目要求在O(n)复杂度及O(1)的额外空间限制下进行解答。

代码：

/**
 * 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 || head->next == NULL)
            return head;
        
        ListNode* head1 = NULL, *head2 = NULL, *p = head, *r = NULL, *q = NULL;     
        while(p != NULL)
        {
            if(head1 == NULL)
            {
                head1 = p;
                r = head1;
            }
            else
            {
                r->next = p;
                r = r->next;
            }
            p = p->next;
            if(p == NULL)
                break;
            if(head2 == NULL)
            {
                head2 = p;
                q = head2;
            }
            else
            {
                q->next = p;
                q = q->next;
            }
            p = p->next;
        }
        r->next = head2;
        q->next = NULL;
        return head1;
    }
};

结果：

一遍AC之后看到这个有点开心，不知道效率是如何评估的though :)

Success!

Runtime: 8 ms, faster than 100.00% of C++ online submissions for Odd Even Linked List.

Memory Usage: 1.2 MB, less than 49.35% of C++ online submissions for Odd Even Linked List.

题外话：

真的有点困233333 明天就是年三十啦！