算法-重建二叉树

package icefire.demo.algorithm.jzOfffer;

import java.util.Arrays;

public class ReConstructBinaryTree {

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

	public static class TreeNode {
		int val;
		TreeNode left;
		TreeNode right;

		TreeNode(int x) {
			val = x;
		}
	}

	public static void main(String[] args) {
		int[] a = {1,2,4,7,3,5,6,8};
		int[] b = {4,7,2,1,5,3,8,6};
		reConstructBinaryTree(a, b);
	}
	
    public static TreeNode reConstructBinaryTree(int [] pre,int [] in) {
    	int r = pre[0];
    	TreeNode root = new TreeNode(r);
    	int m = 0;
    	for(int i = 0; i < in.length; i++) {
    		if(r == in[i]) {
    			m = i;
    			break;
    		}
    	}
    	if(m > 0) {
    		int[] newLeftPre = Arrays.copyOfRange(pre, 1, m + 1);
    		int[] newLeftIn = Arrays.copyOfRange(in, 0, m);
    		root.left = reConstructBinaryTree(newLeftPre, newLeftIn);
    	}
    	if(m < in.length - 1) {
    		int[] newRightPre = Arrays.copyOfRange(pre, m + 1, in.length);
    		int[] newRightIn = Arrays.copyOfRange(in, m + 1, in.length);
    		root.right = reConstructBinaryTree(newRightPre, newRightIn);
    	}
    	return root;
        
    }

}