什么鬼以前写过这篇?可能比四年前强了那么一点点点点点点点……
Given two integer arrays preorder
and inorder
where preorder
is the preorder traversal of a binary tree and inorder
is the inorder traversal of the same tree, construct and return the binary tree.
Example 1:
Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7] Output: [3,9,20,null,null,15,7]
Example 2:
Input: preorder = [-1], inorder = [-1] Output: [-1]
Constraints:
1 <= preorder.length <= 3000
inorder.length == preorder.length
-3000 <= preorder[i], inorder[i] <= 3000
preorder
andinorder
consist of unique values.- Each value of
inorder
also appears inpreorder
. preorder
is guaranteed to be the preorder traversal of the tree.inorder
is guaranteed to be the inorder traversal of the tree.
class Solution:
def buildTree(self, preorder, inorder):
if not preorder:
return None
root = TreeNode()
root.val = preorder[0]
if len(preorder) == 1:
root.left = None
root.right = None
return root
else:
idx = inorder.index(root.val)
l_inorder = inorder[:idx]
r_inorder = inorder[idx+1:]
l_preorder = preorder[1:idx+1]
r_preorder = preorder[idx+1:]
root.left = self.buildTree(l_preorder,l_inorder)
root.right = self.buildTree(r_preorder,r_inorder)
return root