重建二叉树

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并返回。

package Offer;

/*Created By guolujie 2017年10月18日*/

class TreeNode{
	int val;
	TreeNode left = null;
	TreeNode right = null;
	public TreeNode(int val) {
		// TODO Auto-generated constructor stub
		this.val = val;
	}
}
public class ReContructBinaryTree {
	public static TreeNode reConstructBinaryTree(int[] pre , int[] in){
		TreeNode node = reConstructBinaryTree(pre,0,pre.length-1,in,0,in.length-1);
		return node;
	}
	private static TreeNode reConstructBinaryTree(int[] pre,int preStart,int preEnd,int[] in,int inStart,int inEnd){
		if (preStart > preEnd || inStart > inEnd) {
			return null;
		}
		TreeNode root = new TreeNode(pre[preStart]);
		
		for (int i = inStart; i <= inEnd; i++) {
			if (pre[preStart] == in[i]) {
				root.left = reConstructBinaryTree(pre, preStart + 1, preStart + i - inStart, in, inStart, i - 1);
				root.right = reConstructBinaryTree(pre, preStart + i -inStart +1, preEnd, in, i + 1, inEnd);
			}
		}
		return root;
		
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int[] pre = {1,2,4,7,3,5,6,8};
		int[] in = {4,7,2,1,5,3,8,6};
		TreeNode node = reConstructBinaryTree(pre, in);
		System.out.println(node.val);
	}

}