递归的出入口没有做好折腾了半天。
Given inorder and postorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode buildTree(int[] inorder, int[] postorder) {
if (postorder.length == 0) {
return null;
}
if (postorder.length != inorder.length) {
return null;
}
TreeNode result = populateTree(inorder, 0, inorder.length - 1, postorder, 0, postorder.length - 1);
return result;
}
private TreeNode populateTree(int[] io, int iostart, int ioend, int[] po, int postart, int poend) {
if (io.length != po.length) {
return null;
}
if (iostart > ioend || postart > poend || ioend > io.length || poend > po.length) {
return null;
}
int v = po[poend];
TreeNode result = new TreeNode(v);
if (postart == poend) {
return result;
}
int idx = -1;
for (int i = 0; i < io.length; i++) {
if (io[i] == v) {
idx = i;
break;
}
}
result.left = populateTree(io, iostart, idx - 1, po, postart, postart + (idx - iostart - 1));
result.right = populateTree(io, idx + 1, ioend, po, postart + idx - iostart, poend - 1);
return result;
}
}