题目
重点牢记索引更新细节!!!
法1:递归构造
class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
TreeNode root = build(preorder, 0, preorder.length - 1, inorder, 0, inorder.length - 1);
return root;
}
public TreeNode build(int[] preorder, int preStart, int preEnd, int[] inorder, int inStart, int inEnd) {
if (preStart > preEnd) {
return null;
}
if (preStart == preEnd) {
return new TreeNode(preorder[preStart]);
}
TreeNode root = new TreeNode(preorder[preStart]);
int valInx = -1;
for (int i = inStart; i <= inEnd; ++i) {
if (inorder[i] == preorder[preStart]) {
valInx = i;
break;
}
}
int leftSize = valInx - inStart;
TreeNode leftNode = build(preorder, preStart + 1, preStart + leftSize, inorder, inStart, valInx - 1);
TreeNode rightNode = build(preorder, preStart + leftSize + 1, preEnd, inorder, valInx + 1, inEnd);
root.left = leftNode;
root.right = rightNode;
return root;
}
}
class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
return myBuild(preorder, inorder, 0, preorder.length - 1, 0, inorder.length - 1);
}
public TreeNode myBuild(int[] preorder, int[] inorder,
int preStart, int preEnd, int inStart, int inEnd) {
if (preStart > preEnd) {
return null;
} else if (preStart == preEnd) {
return new TreeNode(preorder[preStart]);
}
int rootVal = preorder[preStart], rootInxOfInorder = inStart;
for (int i = inStart; i <= inEnd; ++i) {
if (inorder[i] == rootVal) {
rootInxOfInorder = i;
break;
}
}
TreeNode root = new TreeNode(rootVal);
TreeNode left = myBuild(preorder, inorder, preStart + 1, preStart + rootInxOfInorder - inStart,
inStart, rootInxOfInorder - 1);
TreeNode right = myBuild(preorder, inorder, preStart + rootInxOfInorder - inStart + 1, preEnd,
rootInxOfInorder + 1, inEnd);
root.left = left;
root.right = right;
return root;
}
}