105. 从前序与中序遍历序列构造二叉树

https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/

思路：递归，易知前序的第0号元素为树的根，在中序里找这个根，然后以该根为界将中序数组划分成左右两半，依次递归进行。难点在于每次还要根据中序的划分来将前序数组也划分。

# 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):
        """
        :type preorder: List[int]
        :type inorder: List[int]
        :rtype: TreeNode
        """


        if len(preorder) == 0:
            return None

        root = TreeNode(preorder[0])
        mid = inorder.index(preorder[0])
        #以mid为界划分中序
        in_left = inorder[:mid]
        in_right = inorder[mid+1:]
        #根据中序划分前序
        pre_left = preorder[1:len(in_left)+1]
        pre_right = preorder[len(in_left)+1:]
        #递归左右子树
        root.left = self.buildTree(pre_left, in_left)
        root.right = self.buildTree(pre_right, in_right)

        return root