一、题目
二、思路
- 思路和前&中序遍历一致,关键点在于如何划分各种排序的左子树部分和右子树部分并送入下一层递归,见解法一;
三、解法
解法一
class Solution {
private final HashMap<Integer, Integer> map = new HashMap();
public TreeNode buildTree(int[] inorder, int[] postorder) {
int inB = 0, inE = inorder.length,
postB = 0, postE = postorder.length;
for (int i = 0; i < inorder.length; i++) {
map.put(inorder[i], i);
}
return recursion(inorder, inB, inE, postorder, postB, postE);
}
private TreeNode recursion(
int[] inorder, int inB, int inE,
int[] postorder, int postB, int postE) {
// 递归终止条件
if (inB >= inE || postB >= postE) {
return null;
}
// 找到根结点
int rootVal = postorder[postE - 1];
int rootIndexInIn = map.get(rootVal);
// 连接当前结点
TreeNode node = new TreeNode(rootVal);
// 左子树
int leftLen = rootIndexInIn - inB;
node.left = recursion(
/* 9 (3) 15 20 7 */
inorder, inB, rootIndexInIn,
/* 9 15 7 20 (3) */
postorder, postB, postB + leftLen
);
// 右子树
node.right = recursion(
/* 9 (3) 15 20 7 */
inorder, rootIndexInIn + 1, inE,
/* 9 15 7 20 (3) */
postorder, postB + leftLen, postE - 1
);
return node;
}
}