Java 从前序与中序遍历序列构造二叉树leetcode

给定两个整数数组 preorder 和 inorder ，其中 preorder 是二叉树的先序遍历， inorder 是同一棵树的中序遍历，请构造二叉树并返回其根节点。

/**
 * 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 {
    public TreeNode buildTree(int[] preorder, int[] inorder) {   
        HashMap<Integer,Integer> map = new HashMap<>();
        for(int i = 0;i< inorder.length;i++){
            map.put(inorder[i],i);
        }   
        return buildTreeHelp(preorder,0,preorder.length,inorder,0,inorder.length,map);
    }

    public TreeNode buildTreeHelp(int[] preorder,int preorder_start ,int preorder_end,
    int[] inorder,int inorder_start,int inorder_end,HashMap<Integer,Integer> map){
        if(preorder_start == preorder_end){
            return null;
        }
        int root_val = preorder[preorder_start];
        TreeNode root = new TreeNode(root_val);
        //在中序遍历中找到根节点的位置
        // int root_index = 0;
        // for(int i = inorder_start ; i < inorder_end ; i++){
        //     if(inorder[i] == root_val){
        //         root_index = i;
        //         break;
        //     }
        // }
        int root_index = map.get(root_val);
        //左子树长度
        int leftNum = root_index - inorder_start;

        root.left = buildTreeHelp(preorder , preorder_start + 1 , preorder_start+1+leftNum,inorder, inorder_start,root_index,map);

        root.right = buildTreeHelp(preorder,preorder_start + 1 + leftNum,preorder_end,
        inorder,root_index + 1,inorder_end,map);

        return root;

    }
}