lintcode,前序遍历和中序遍历树构造二叉树

根据前序遍历和中序遍历树构造二叉树.
注意事项
你可以假设树中不存在相同数值的节点
样例
给出中序遍历：[1,2,3]和前序遍历：[2,1,3]. 返回如下的树:
2
/ \
1 3

一刷ac。
解题思路：根据前序特点，找到跟节点，然后切分前序和中序，分别找左右跟节点。

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */


public class Solution {
    /**
     *@param preorder : A list of integers that preorder traversal of a tree
     *@param inorder : A list of integers that inorder traversal of a tree
     *@return : Root of a tree
     */
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        if(preorder.length == 0 || inorder.length == 0) return null;
        return build(preorder, 0, preorder.length-1, inorder, 0, inorder.length-1);

    }

    public TreeNode build(int[] preorder, int pre_start, int pre_end, int[] inorder, int in_start, int in_end){
        if(pre_start > pre_end || in_start > in_end) return null;
        TreeNode root = new TreeNode(preorder[pre_start]);
        if(pre_start == pre_end) return root;
        int pivot = in_start;
        for(int i = in_start; i <= in_end; i++){
            if(inorder[i] == preorder[pre_start]){
                pivot = i;
                break;
            }
        }
        root.left = build(preorder, pre_start+1, pre_start+pivot-in_start, inorder, in_start, pivot-1);
        root.right = build(preorder, pre_start+pivot-in_start+1, pre_end, inorder, pivot+1, in_end);
        return root;
    }
}