leedcode 从中序与后序遍历序列构造二叉树

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

class Solution(object):
    def buildTree(self, inorder, postorder):
        """
        :type inorder: List[int]
        :type postorder: List[int]
        :rtype: TreeNode
        """
        if len(postorder) == 0:
            return None
        root = TreeNode(postorder[-1])
        if len(inorder) == 1:
            return root
        leftin = []
        leftpost = []
        rightin = []
        rightpost = []
        location = 0
        while inorder[location] != root.val:
            leftin.append(inorder[location])
            location += 1
        for i in range(location):
            leftpost.append(postorder[i])
        for i in range(location + 1, len(inorder)):
            rightin.append(inorder[i])
        for i in range(location, len(postorder) - 1):
            rightpost.append(postorder[i])
        root.left = self.buildTree(leftin, leftpost)
        root.right = self.buildTree(rightin, rightpost)
        return root