剑指offer-2.28-7

最新推荐文章于 2021-03-25 15:37:41 发布

Desperate_gh

最新推荐文章于 2021-03-25 15:37:41 发布

阅读量83

点赞数

分类专栏：剑指Offer 文章标签： leetcode

本文链接：https://blog.csdn.net/Desperate_gh/article/details/114220955

版权

剑指Offer 专栏收录该内容

62 篇文章 0 订阅

订阅专栏

在这里插入图片描述

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    private Map<Integer, Integer> indexMap;

    public TreeNode myBuildTree(int[] preorder, int[] inorder, int pre_left, int pre_right, int in_left, int in_right) {
        if (pre_left > pre_right) {
            return null;
        }
        TreeNode root = new TreeNode(preorder[pre_left]);
        // 根在中序中的索引
        int in_root_index = indexMap.get(preorder[pre_left]);
        root.left = myBuildTree(preorder, inorder, pre_left + 1, pre_left + in_root_index - in_left, in_left, in_root_index - 1);
        root.right = myBuildTree(preorder, inorder, pre_left + in_root_index - in_left + 1, pre_right, in_root_index + 1, in_right);
        return root;

    }

    public TreeNode buildTree(int[] preorder, int[] inorder) {
        indexMap = new HashMap<Integer, Integer>();
        for (int i = 0; i < inorder.length; i++) {
            indexMap.put(inorder[i], i);
        }
        return myBuildTree(preorder, inorder, 0, preorder.length - 1, 0, inorder.length - 1);
    }
}