剑指offer、牛客-重建二叉树

/**
 * 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) {
		
        return reBuildBinaryTree(pre,0,pre.length-1, in, 0, in.length-1);
        
    }
    private TreeNode reBuildBinaryTree(int [] pre,int pStart,int pEnd, int [] in, int iStart,int iEnd){
        //树成立的条件
        if(pStart > pEnd || iStart > iEnd)
            return null;
        //初始化树的根节点
        TreeNode rootNode = new TreeNode(pre[pStart]);
        
		//分割树的前序、中序遍历序列
        for(int i = 0; i < in.length; i++){
            if(in[i] == pre[pStart]){
                rootNode.left = reBuildBinaryTree( pre, pStart+1, pStart+i-iStart, in, iStart, i-1);
        		rootNode.right = reBuildBinaryTree( pre, pStart+i-iStart+1,pEnd, in, i+1,iEnd);
                break;
            }
        }
        return rootNode;
    }
    
}