leetcode 根据前序中序建树

https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof/solution/mian-shi-ti-07-zhong-jian-er-cha-shu-by-leetcode-s/

• 思路：
• 我的：
  根据递归建树，找出根节点在中序遍历中的位置（循环），递归建树

package offer.class6;

import java.awt.image.AreaAveragingScaleFilter;
import java.lang.reflect.Array;
import java.util.Arrays;

/**
 *剑指offer7
 * leetcode
 * https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof/
 *
 * 根据二叉树前序 中序 建树
 */
public class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        TreeNode root = null;
        if (preorder.length == 0 || inorder.length == 0){
            return root;
        }
        root = new TreeNode(preorder[0]);
        for (int i = 0; i < inorder.length; i++) {
            if (preorder[0] == inorder[i]){
                root.left = buildTree(Arrays.copyOfRange(preorder,1,i+1), Arrays.copyOfRange(inorder,0,i));
                root.right = buildTree(Arrays.copyOfRange(preorder,i+1,preorder.length),Arrays.copyOfRange(inorder,i+1,inorder.length));
            }
        }
        return root;

    }


}

• 官方改进：
  • 循环找根节点在中序遍历中的位置复杂度高，可以使用map
  • 但是和上面不同的是，用map，就不能改变数组了，所以需要增加参数，加上数组此次起始位置和结束位置，递归出口即 left>value

/**
 * 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>map ;
    public TreeNode mybuild(int[] preorder, int[] inorder,int preorder_left,int preorder_right,int inorder_left,int inorder_right) {
        TreeNode root = null;
        if (preorder_left>preorder_right){
           return  root;
       }
        root = new TreeNode(preorder[preorder_left]);
       
        int location = map.get(root.val);
        int size_count = location - inorder_left;
        root.left = mybuild(preorder,inorder,preorder_left+1,preorder_left+size_count,inorder_left,location-1);
        root.right = mybuild(preorder,inorder,preorder_left+size_count+1,preorder_right,location+1,inorder_right);



        return root;

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


    }

}