代码解析
class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
if (preorder.length == 0 || inorder.length == 0) return null;
TreeNode root = new TreeNode(preorder[0]);
for(int i = 0; i < preorder.length; i++){
if(preorder[0] == inorder[i]){
root.left = buildTree(Arrays.copyOfRange(preorder,1,i+1), Arrays.copyOfRange(inorder,0,i));
root.right = buildTree(Arrays.copyOfRange(preorder,i+1,preorder.length), Arrays.copyOfRange(inorder,i+1,inorder.length));
break;
}
}
return root;
}
}
代码解析
class Solution {
public TreeNode buildTree(int[] inorder, int[] postorder) {
int i_len = inorder.length;
int p_len = postorder.length;
if(i_len == 0 || p_len == 0) return null;
TreeNode root = new TreeNode(postorder[p_len-1]);
for(int i = 0; i < p_len; i++){
if(postorder[p_len-1] == inorder[i]){
root.left = buildTree(Arrays.copyOfRange(inorder, 0, i), Arrays.copyOfRange(postorder, 0, i));
root.right = buildTree(Arrays.copyOfRange(inorder, i+1, i_len), Arrays.copyOfRange(postorder, i, p_len-1));
break;
}
}
return root;
}
}