python写算法题：leetcode: 105. Construct Binary Tree from Preorder and Inorder Traversal

最新推荐文章于 2021-03-18 16:18:19 发布

激荡数十年

最新推荐文章于 2021-03-18 16:18:19 发布

阅读量147

点赞数

分类专栏：算法 python

本文链接：https://blog.csdn.net/lzf_china/article/details/100096751

版权

算法同时被 2 个专栏收录

158 篇文章 0 订阅

订阅专栏

python

115 篇文章 0 订阅

订阅专栏


class Solution(object):
    def constructTree(self, preorder, inorder, indMap, preind0, preind1, inind0, inind1):
        if preind0>=preind1:
            return None
        node=TreeNode(preorder[preind0])
        pos=indMap[preorder[preind0]]
        node.left=self.constructTree(preorder, inorder, indMap, preind0+1, pos-inind0+preind0+1, inind0, pos)
        node.right=self.constructTree(preorder, inorder, indMap, pos-inind0+preind0+1, preind1, pos+1, inind1)
        return node
    
    def buildTree(self, preorder, inorder):
        """
        :type preorder: List[int]
        :type inorder: List[int]
        :rtype: TreeNode
        """
        if len(preorder)<=0: 
            return None
        indMap={}
        for i,v in enumerate(inorder):
            indMap[v]=i
        head=TreeNode(preorder[0])
        pos=indMap[preorder[0]]
        head.left=self.constructTree(preorder, inorder, indMap, 1, pos+1, 0, pos)
        head.right=self.constructTree(preorder, inorder, indMap, pos+1, len(preorder), pos+1, len(preorder))
        return head