剑指 Offer 07. 重建二叉树

最新推荐文章于 2020-10-12 13:50:10 发布

诠释信仰

最新推荐文章于 2020-10-12 13:50:10 发布

阅读量109

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/weixin_43502415/article/details/107795269

版权

剑指offer 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

输入某二叉树的前序遍历和中序遍历的结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。

例如，给出

前序遍历 preorder = [3,9,20,15,7]
中序遍历 inorder = [9,3,15,20,7]
返回如下的二叉树：

/
9 20
/
15 7

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        if(preorder == null || preorder.length == 0){
            return null;
        }
        Map<Integer,Integer> hashMap = new HashMap<>();
        for(int i = 0; i <preorder.length; i++){
            hashMap.put(preorder[i],i);
        }

TreeNode root = treeBuild(preorder, 0, preorder.length - 1,inorder, 0, inorder.length - 1,hashMap);
        return root;


    }

    public  TreeNode treeBuild(int[]preorder, int preStart, int preEnd, int[]inorder, int inStart, int inEnd, Map<Integer, Integer> hashMap){
       if(preStart > preEnd){
           return null;
       }
       int valNode = preorder[preStart];
       TreeNode root = new TreeNode(valNode);
       if (preStart == preEnd){
           return root;
       }else{
           int index = hashMap.get(preorder[preStart]);
           int leftLength = index - inStart;
           int rightLength = inEnd - index;
           TreeNode leftSubtree = treeBuild(preorder, preStart + 1,  preStart + leftLength, inorder,inStart, index - 1,hashMap);
           TreeNode rightSubtree = treeBuild(preorder, preEnd - rightLength + 1, preEnd, inorder, index + 1, inEnd, hashMap);
           root.left = leftSubtree;
           root.right = rightSubtree;
           return root;


       }
     
    }


}