力扣刷题记录 -- JAVA--46---105. 从前序与中序遍历序列构造二叉树

---

一、题目

二、代码

/**
 * 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 
{
    //迭代法 非常巧妙
    //但还是迭代法更容易理解
    //建立一个哈希表  方便从前序遍历中快速获取值

    Map<Integer,Integer> map = new HashMap<>();

    public TreeNode build(int[] preorder,int[] inorder, int preorder_left, int preorder_right, int inorder_left, int inorder_right)
    {
        if(preorder_left >preorder_right || inorder_left>inorder_right) return null;
        
        //每次取前序第一个
        TreeNode root = new TreeNode(preorder[preorder_left]);
 
        int root_index = map.get(root.val);

        int size = root_index - inorder_left;

        //左右都是舍去一个
        root.left = build(preorder,inorder,preorder_left+1,preorder_left+size,inorder_left,root_index-1);
        root.right = build(preorder,inorder,preorder_left+size+1,preorder_right ,root_index+1, inorder_right);
        //找到前序遍历根节点  拆分构造
        return root;
    }
    public TreeNode buildTree(int[] preorder, int[] inorder) 
    {
         
         int i;
         int length = inorder.length;

         for(i=0;i<length;i++)
         {
             map.put(inorder[i],i);
         }
         
         return build(preorder,inorder,0,length-1,0,length-1);
    }
}

三、运行结果