【剑指 Offer 07. 重建二叉树】

题目

题解

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int[] p;
    // 保存某个结点在中序遍历的下标，用于快速找到中序遍历的根节点
    Map<Integer, Integer> map = new HashMap<>();
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        p = preorder;
        for (int i = 0;i < inorder.length;i++) {
            map.put(inorder[i], i);
        }
        return fun(0, 0, preorder.length - 1);
    }

    // root为前序遍历的根节点下标   left和right为以该根节点为树,中序遍历的边界
    public TreeNode fun(int root, int left, int right) {
        if (left > right) {
            return null;
        }
        TreeNode rootNode = new TreeNode(p[root]);
        // 根节点在中序遍历的下标
        int inroot = map.get(p[root]);
        // 左子树大小
        int leftSize = inroot - left;
        rootNode.left = fun(root + 1, left, inroot - 1);
        rootNode.right = fun(root + leftSize + 1, inroot + 1, right);
        return rootNode;
    }
}