关闭

Odd Even Linked List

68人阅读 评论(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:
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 ...

Credits:

Special thanks to @DjangoUnchained for adding this problem and creating all test cases.

思路:

将一个链表的奇数节点放在偶数节点的前面。首相将整个链表拆分成两部分,一部分是由奇数节点构成,一部分是由偶数节点组成。而后将两部分进行链接就可以了

/**
 * 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) {
        ListNode *dummy=new ListNode(0);
        dummy->next=head;
        ListNode *res=head;
        ListNode *res_odd=new ListNode(0),*p=res_odd;
        ListNode *res_even=new ListNode(0),*q=res_even;
        int len=0;
        while(res)
        {
            if((++len)%2==1)
            {
                p->next=res;
                p=res;
            }
            else
            {
                q->next=res;
                q=res;
            }
            res=res->next;
        }
        q->next=NULL;
        p->next=res_even->next;
        return res_odd->next;
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:7357次
    • 积分:1115
    • 等级:
    • 排名:千里之外
    • 原创:110篇
    • 转载:0篇
    • 译文:0篇
    • 评论:0条