给定两个整数数组 inorder 和 postorder ,其中 inorder 是二叉树的中序遍历, postorder 是同一棵树的后序遍历,请你构造并返回这颗 二叉树 。
示例 1:
输入:inorder = [9,3,15,20,7], postorder = [9,15,7,20,3]
输出:[3,9,20,null,null,15,7]
示例 2:
输入:inorder = [-1], postorder = [-1]
输出:[-1]
提示:
1 <= inorder.length <= 3000
postorder.length == inorder.length
-3000 <= inorder[i], postorder[i] <= 3000
inorder 和 postorder 都由 不同 的值组成
postorder 中每一个值都在 inorder 中
inorder 保证是树的中序遍历
postorder 保证是树的后序遍历
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
题解:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
int postIndex = 0;
int findIndexOfI(int[] inorder, int inbegin, int inend, int key) {
for (int i = inbegin; i <= inend; i++) {
if (inorder[i] == key) return i;
}
return -1;
}
TreeNode createTreeByIandP(int[] inorder, int[] postorder, int inbegin, int inend) {
if (inbegin > inend) return null;
TreeNode root = new TreeNode(postorder[postIndex]);
int rootIndex = findIndexOfI(inorder, inbegin, inend, postorder[postIndex]);
if (rootIndex == -1) return null;
postIndex--;
root.right = createTreeByIandP(inorder, postorder, rootIndex + 1, inend);
root.left = createTreeByIandP(inorder, postorder, inbegin, rootIndex - 1);
return root;
}
public TreeNode buildTree(int[] inorder, int[] postorder) {
if (inorder == null || postorder == null) return null;
postIndex = postorder.length - 1;
return createTreeByIandP(inorder, postorder, 0, inorder.length - 1);
}
}