【LeetCode with Python】 Reorder List

最新推荐文章于 2024-02-28 13:59:57 发布

3x3只眼

最新推荐文章于 2024-02-28 13:59:57 发布

阅读量2.9k

点赞数

本文链接：https://blog.csdn.net/nerv3x3/article/details/37337343

版权

LeetCode with Python 同时被 2 个专栏收录

104 篇文章 0 订阅

订阅专栏

LeetCode with Python

104 篇文章 175 订阅

订阅专栏

博客域名： http://www.xnerv.wang
原题页面： https://oj.leetcode.com/problems/reorder-list/
题目类型：
难度评价：★
本文地址： http://blog.csdn.net/nerv3x3/article/details/37337343

Given a singly linked list L: L₀→L₁→…→L_n-1→L_n,
reorder it to: L₀→L_n→L₁→L_n-1→L₂→L_n-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}.

class Solution:

    # @param head, a ListNode
    # @return nothing
    def reorderList(self, head):

        if None == head:
            return
        cur = head
        count = 0
        while None != cur:
            cur = cur.next
            count += 1
        if count <= 2:
            return

        half_count = (count - 1) / 2
        cur2 = head
        for i in range(0, half_count):
            cur2= cur2.next
        cur2_next = cur2.next
        cur2.next = None
        cur2 = reverse_list(cur2_next, None, None)

        cur1 = head
        time_count = int(count / 2)
        for i in range(0, time_count):
            cur2_next = cur2.next
            cur2.next = cur1.next
            cur1.next = cur2
            cur1 = cur2.next
            cur2 = cur2_next