剑指offer重建二叉树

public class Solution {
	public TreeNode reConstructBinaryTree(int[] pre, int[] in) {
		TreeNode root = reConstructBinaryTree(pre, 0, pre.length - 1, in, 0, in.length - 1);
		return root;
	}

	private TreeNode reConstructBinaryTree(int[] pre, int startPre, int endPre, int[] in, int startIn, int endIn) {

		if (startPre > endPre || startIn > endIn)
			return null;
		TreeNode root = new TreeNode(pre[startPre]);

		for (int i = startIn; i <= endIn; i++)
			if (in[i] == pre[startPre]) {
				root.left = reConstructBinaryTree(pre, startPre + 1, startPre + i - startIn, in, startIn, i - 1);
				root.right = reConstructBinaryTree(pre, i - startIn + startPre + 1, endPre, in, i + 1, endIn);
			}

		return root;
	}

}

大佬的代码说实话看不懂，易读不易想

我选择这种

/**
 * 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) {
        int i=0;
        if(pre.length!=in.length)
            return null;
        if(pre.length == 0 || in.length == 0){
            return null;
}
        TreeNode root = new TreeNode(pre[0]);
        while(in[i]!=root.val)
            i++;
        int[] preleft = new int[i];
        int[] preright = new int[pre.length - i - 1];
        int[] inleft = new int[i];
        int[] inright = new int[pre.length - i - 1];
        for(int j = 0;j < in.length;j++){
            if(j<i){
                preleft[j] = pre[j+1];
                inleft[j] =in[j];
            }else if(j > i){
                preright[j-i-1] = pre[j];
                inright[j-i-1] = in[j];
            }
        }
        
        root.left = reConstructBinaryTree(preleft,inleft);
        root.right = reConstructBinaryTree(preright,inright);
        return root;
}
}