leetcode 105 106

前序中序 重构二叉树 105

python 我的代码

# 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, preorder, inorder):
        """
        :type preorder: List[int]
        :type inorder: List[int]
        :rtype: TreeNode
        """
        if(preorder==None or inorder == None):
            return None
        return (self.help(preorder,inorder))
    def help(self,preorder,inorder):
        if(len(preorder) == 0):
            return None
        number = preorder[0]
        head = TreeNode(number)
        pre_inorder =  inorder.index(number)
        head.left = self.help(preorder[1:pre_inorder+1],inorder[0:pre_inorder])
        head.right = self.help(preorder[pre_inorder+1:len(preorder)],inorder[pre_inorder+1:len(inorder)])
        return head

别人的代码

# 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, preorder, inorder):
        if inorder:
            ind = inorder.index(preorder.pop(0))
            root = TreeNode(inorder[ind])
            root.left = self.buildTree(preorder, inorder[0:ind])
            root.right = self.buildTree(preorder, inorder[ind+1:])
            return root

后序中序 重构二叉树 106

class Solution(object):
    def buildTree(self, inorder, postorder):
        """
        :type inorder: List[int]
        :type postorder: List[int]
        :rtype: TreeNode
        """
        if(len(inorder)==0):
            return None
        root = TreeNode(postorder[-1])
        index = inorder.index(postorder[-1])
        root.left =self.buildTree(inorder[0:index],postorder[0:index])
        root.right =self.buildTree(inorder[index+1:],postorder[index:-1])
        return root