2024/9/01 LeetCode Hot100 binaryTree
This commit is contained in:
parent
19151f857e
commit
21b649fbe6
|
@ -30,7 +30,6 @@ public class Num105 {
|
||||||
TreeNode node = new TreeNode(preorder[indexInPre]);
|
TreeNode node = new TreeNode(preorder[indexInPre]);
|
||||||
Integer headInIn = map.get(preorder[indexInPre]);
|
Integer headInIn = map.get(preorder[indexInPre]);
|
||||||
int leftLength = headInIn - startInIn;
|
int leftLength = headInIn - startInIn;
|
||||||
int rightLength = endInIn - headInIn;
|
|
||||||
node.left = buildTree(preorder,indexInPre+1,startInIn,headInIn-1);
|
node.left = buildTree(preorder,indexInPre+1,startInIn,headInIn-1);
|
||||||
node.right=buildTree(preorder,indexInPre+leftLength+1,headInIn+1,endInIn);
|
node.right=buildTree(preorder,indexInPre+leftLength+1,headInIn+1,endInIn);
|
||||||
return node;
|
return node;
|
||||||
|
|
Loading…
Reference in New Issue