109. 有序链表转化为二叉搜索树

最新推荐文章于 2024-08-19 13:32:52 发布

WhyNot?

最新推荐文章于 2024-08-19 13:32:52 发布

阅读量65

点赞数

分类专栏： LeetCode 文章标签：链表 python leetcode 笔记

本文链接：https://blog.csdn.net/JESSIENOTCAR/article/details/134439554

版权

LeetCode 专栏收录该内容

39 篇文章 1 订阅

订阅专栏

题目

在这里插入图片描述

题解

分治。

class Solution:

    def getMedian(self, left: ListNode, right: ListNode) -> ListNode:
            '''找到链表的中间节点'''
            slow = fast = left
            while fast != right and fast.next != right:
                slow = slow.next
                fast = fast.next.next
            return slow

    def buildTree(self, left: ListNode, right: ListNode) -> TreeNode:
        """左闭右开"""
        if left == right:
            return None
        mid = self.getMedian(left, right)
        root = TreeNode(mid.val)
        root.left = self.buildTree(left, mid)
        root.right = self.buildTree(mid.next, right)
        return root

    def sortedListToBST(self, head: Optional[ListNode]) -> Optional[TreeNode]:
        return self.buildTree(head, None)