LeetCode105 根据前序和中序遍历构建二叉树

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

For example, given

preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]
Return the following binary tree:

3

/
9 20
/
15 7

public TreeNode buildTree(int[] preorder, int[] inorder) {
        int m = preorder.length - 1;
        int n = inorder.length - 1;
        return buildCore(preorder, 0, m, inorder, 0, n);
    }
    public TreeNode buildCore(int[] preorder, int startPre, int endPre, int[] inorder, int startIn, int endIn){
        if(startPre > endPre || startIn > endIn) return null;
        TreeNode root = new TreeNode(preorder[startPre]);
        if(startPre == endPre) return root;
        int i;
        for(i = startIn; i <= endIn; i++){
            if(inorder[i] == root.val) break;
        }
        int leftlen = i - startIn;
        if(leftlen > 0){
            root.left = buildCore(preorder, startPre+1, startPre + leftlen, inorder, startIn, startIn + leftlen - 1);
        }
        if(leftlen < endIn - startIn){
            root.right = buildCore(preorder, startPre + leftlen + 1, endPre, inorder, i+1, endIn);
        }
        return root;
    }