解法一:
时间空间复杂度双高
应该是因为使用了Arrays.copyOfRange()函数导致的
新思路 不传入数组 改为传入数组下标 ===>解法二
public static TreeNode buildTree(int[] preorder, int[] inorder) {
//如果数组中没有节点 直接返回null
if (preorder.length==0) return null;
TreeNode treeNode = new TreeNode(preorder[0]);
//如果数组中只有一个节点 直接返回
if (preorder.length==1) return treeNode;
int i = 0;
while (inorder[i] != treeNode.val){
i++;
}
//左子树
if (i > 0){
treeNode.left = buildTree(Arrays.copyOfRange(preorder,1,i+1),Arrays.copyOfRange(inorder,0,i));
}
//右子树
if ((preorder.length > i+1)&&(inorder.length > i+1))
treeNode.right = buildTree(Arrays.copyOfRange(preorder,i+1,preorder.length),Arrays.copyOfRange(inorder,i+1,inorder.length));
return treeNode;
}
解法二:
public static TreeNode buildTree2(int[] pre, int[] in ){
if (pre.length<1 || pre.length != in.length) return null;
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < in.length; i++) {
map.put(in[i],i);
}
TreeNode head = getChildTree(pre, 0,pre.length-1,0,in.length-1,map);
return head;
}
public static TreeNode getChildTree(int[] pre, int pl, int pr,int il, int ir,Map<Integer,Integer> map){
// System.out.println("pl:"+pl+" pr:"+pr+" il:"+il+" ir:"+ir);
if (pl > pr || il > ir || (pr - pl) != (ir - il)) return null;
if (pl == pr){
return new TreeNode(pre[pl]);
}
TreeNode treeNode = new TreeNode(pre[pl]);
// 获取该节点在中序遍历的索引
Integer mid = map.get(pre[pl]);
// System.out.println("mid:"+mid);
// System.out.println("-----");
// 左子树长度
Integer leftLen = mid - il;
// 右子树长度
Integer rightLen = ir - mid;
treeNode.left = getChildTree(pre, pl+1,pl+leftLen,il,il+leftLen-1,map);
treeNode.right = getChildTree(pre, pl+leftLen+1,pl+leftLen+rightLen,mid+1,mid+rightLen,map);
return treeNode;
}