剑指offer 04：重构二叉树

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */   
public class Solution {
    public TreeNode reConstructBinaryTree(int[] pre, int[] in) {
        if(pre.length == 0 ||in.length == 0)
            return null;
        return ConstructBinaryTree(pre, 0, pre.length-1, in, 0, in.length - 1);
    }
    public TreeNode ConstructBinaryTree(int[] pre, int pstart, int pend, int[] in, int istart, int iend){
        if(pstart > pend || istart > iend)
            return null;
        TreeNode root = new TreeNode(pre[pstart]);
        for(int i = istart; i <= iend; i++){
            if(in[i] == pre[pstart]){
                root.left = ConstructBinaryTree(pre, pstart+1, pstart + i - istart, in, istart, i - 1);
                root.right = ConstructBinaryTree(pre, pstart + i - istart + 1, pend, in, i + 1, iend);
                break;
            }
        }
        return root;
    }
}