LeetCoder Reorder List

最新推荐文章于 2016-08-21 16:28:49 发布

lqcsp

最新推荐文章于 2016-08-21 16:28:49 发布

阅读量549

点赞数

分类专栏： LeetCode 面试题 c++ 文章标签： leetcode 合并链表面试

本文链接：https://blog.csdn.net/lqcsp/article/details/23018859

版权

c++ 同时被 2 个专栏收录

80 篇文章 0 订阅

订阅专栏

LeetCode 面试题

73 篇文章 1 订阅

订阅专栏

题目要求：

Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

You must do this in-place without altering the nodes' values.

For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.

思路：

1把整个链表划分成2个等长的子链表，如果原链表长度为奇数，那么第一个子链表的长度多1。

2.翻转第二个子链表；

3.将两个子链表合并。

代码：

class Solution {
public:
    void reorderList(ListNode* head) {
        if(head == NULL || head->next == NULL)
            return ;
        ListNode* slow_ptr = head;
        ListNode* fast_ptr = head;
        //找到中间节点位置
        while(fast_ptr->next != NULL)
        {
            fast_ptr = fast_ptr->next;
            if(fast_ptr->next !=NULL)
                fast_ptr = fast_ptr->next;
            else
                break;
            slow_ptr = slow_ptr->next;
        }
        //设置两个新链表的头结点
        ListNode* head1 = head, *head2 = slow_ptr->next;
        slow_ptr->next = NULL;
        ListNode* cur = head2, *post = cur->next;
        head2->next = NULL;

        while(post != NULL)//翻转第二个链表
        {
            ListNode* tmp = post->next;
            post->next = cur;
            cur = post;
            post = tmp;
        }
        head2 = cur;
        ListNode* p = head1;
        ListNode* q = head2;
        while(q != NULL)//将两个链表合并即得到结果
        {
            ListNode* tmp1 = p->next;
            ListNode* tmp2 = q->next;
            p->next = q;
            q->next = tmp1;
            p = tmp1;
            q = tmp2;
        }
    }
};