题意:给出一个二叉树的前序和中序遍历,求出这个二叉树
思路:首先枚举中序遍历找到根节点,之后再向左向右递归,并缩小遍历范围,若存在左节点左树根就是start+1,右树根位置可以根据当前根在中序和前序中的相对位置确定
class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
return solve(preorder, inorder, 0, 0, preorder.length-1);
}
public TreeNode solve(int[] preorder, int[] inorder, int start, int l, int r) {
if (start >= preorder.length)
return null;
TreeNode root = new TreeNode(preorder[start]);
for (int i = l; i <= r; i++) {
if (inorder[i] == preorder[start]) {
if (i != l) {
root.left = solve(preorder, inorder, start+1, l, i-1);
}
if (i != r) {
root.right = solve(preorder, inorder, start+i-l+1, i+1, r);
}
break;
}
}
return root;
}
}