leetcode 从前序与中序遍历序列构造二叉树 python3

根据一棵树的前序遍历与中序遍历构造二叉树。

注意:
你可以假设树中没有重复的元素。

例如，给出

前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树：

    3
   / \
  9  20
    /  \
   15   7

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
 #通过前序遍历第一个节点找到根
 #找到该节点在中序遍历里的索引位置
 #该节点在中序遍历中，左边为左子树，右边为右子树
 #递归左右子树
      
class Solution:
    def buildTree(self, preorder, inorder):
        if inorder == []:
            return None
        root = TreeNode(preorder[0])
 
        x = inorder.index(root.val)#找到根在中序中的位置
        root.left = self.buildTree(preorder[1:x+1], inorder[0:x])
        root.right = self.buildTree(preorder[x+1:], inorder[x+1:])
        return root

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def buildTree(self, preorder: List[int], inorder: List[int]) -> TreeNode:
        # O(N^2)解法
        # def dfs(pre_s,pre_e,in_s,in_e):
        #     if pre_s>=pre_e:
        #         return None
        #     root = TreeNode(preorder[pre_s])
        #     pre_mid,in_mid = pre_s,in_s
        #     for i in range(in_s,in_e):
        #         if root.val==inorder[i]:
        #             pre_mid = pre_s+i-in_s+1
        #             in_mid = i+1
        #             break
        #     root.left = dfs(pre_s+1,pre_mid,in_s,in_mid)
        #     root.right = dfs(pre_mid,pre_e,in_mid,in_e)
        #     return root
        # return dfs(0,len(preorder),0,len(inorder))
        # 利用哈希表存储位置 牺牲空间节省时间
        in_order_dic = {inorder[i]:i for i in range(len(inorder))}
        def dfs(pre_s,pre_e,in_s,in_e):
            if pre_s>=pre_e:
                return None
            # print(pre_s,pre_e)
            root = TreeNode(preorder[pre_s])
            index = in_order_dic[root.val]
            pre_mid = pre_s+index-in_s+1
            in_mid = index+1
            root.left = dfs(pre_s+1,pre_mid,in_s,in_mid)
            root.right = dfs(pre_mid,pre_e,in_mid,in_e)
            return root
        return dfs(0,len(preorder),0,len(inorder))