【树-中等】105. 从前序与中序遍历序列构造二叉树

【题目】
给定一棵树的前序遍历 preorder 与中序遍历 inorder。请构造二叉树并返回其根节点。

示例 1:

Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
Output: [3,9,20,null,null,15,7]

示例 2:

Input: preorder = [-1], inorder = [-1]
Output: [-1]

提示:
1 <= preorder.length <= 3000
inorder.length == preorder.length
-3000 <= preorder[i], inorder[i] <= 3000
preorder 和 inorder 均无重复元素
inorder 均出现在 preorder
preorder 保证为二叉树的前序遍历序列
inorder 保证为二叉树的中序遍历序列
【代码】

class Solution:

    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        if not preorder:
            return None
        maxnum=preorder[0]
        maxindex=inorder.index(maxnum)
        root=TreeNode(maxnum)
        root.left=self.buildTree(preorder[1:maxindex+1],inorder[:maxindex])
        root.right=self.buildTree(preorder[maxindex+1:],inorder[maxindex+1:])
        return root

【方法2】

class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        def deal(preorder_low,preorder_high,inorder_low,inorder_high):
            if inorder_low>inorder_high:
                return None
            root=TreeNode(preorder[preorder_low])
            mid=index[preorder[preorder_low]]
            length=mid-inorder_low
            root.left=deal(preorder_low+1,preorder_low+length,inorder_low,mid-1)
            root.right=deal(preorder_low+length+1,preorder_high,mid+1,inorder_high)
            return root
        index={x:inorder.index(x) for x in preorder}
        n=len(index)
        return deal(0,n-1,0,n-1)