易错点:边界条件,两个数组的前后位置都要保存。模拟计算得到边界即可。一次是对的。
可以设置类变量,让函数更简单
使用哈希表存inorder的位置更好,更易找到位置。o(1)
因为是无序的数组,不能用二叉查找。
有序数组中使用二叉查找函数:Arrays.binarySearch(arr,target);
/**
* Definition for a binary tree node.
* class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
HashMap<Integer, Integer> map = new HashMap<>();
public TreeNode buildTree(int[] preorder, int[] inorder) {
for (int i = 0; i < inorder.length; i++)
map.put(inorder[i], i);
return helper(preorder,inorder,0,preorder.length-1,0,preorder.length-1);
}
public TreeNode helper(int[] preorder, int[] inorder,int preLeft, int preRight, int inLeft ,int inRight){
if(preLeft > preRight||inLeft > inRight)
{
return null;
}else{
TreeNode root = new TreeNode(preorder[preLeft]);
int index = map.get(preorder[preLeft]);
root.left = helper(preorder, inorder, preLeft+1, preLeft+index-inLeft, inLeft,index-1);
root.right = helper(preorder, inorder, preLeft+index-inLeft+1, preRight, index+1, inRight);
return root;
}
}
}