剑指offer|面试题6：重建二叉树（Java实现）

测试链接：https://www.nowcoder.com/questionTerminal/8a19cbe657394eeaac2f6ea9b0f6fcf6
来源：牛客网

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

package data.structure.day0408;

/**
 * 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 length = pre.length;
		TreeNode root = solve(pre, 0, length - 1, in, 0, length - 1);
		return root;
	}

	private TreeNode solve(int[] pre, int preStart, int preEnd, int[] in, int inStart, int inEnd) {
		if (preStart > preEnd || inStart > inEnd)
			return null;
		int num = 0;
		for (int i = inStart; i <= inEnd; i++) {
			if (pre[preStart] == in[i]) {
				num = i;
				break;
			}
		}
		int leftNum = num - inStart;
		TreeNode root = new TreeNode(pre[preStart]);
		root.left = solve(pre, preStart + 1, preStart + leftNum, in, inStart, inStart + leftNum);
		root.right = solve(pre, preStart + leftNum + 1, preEnd, in, inStart + leftNum + 1, inEnd);

		return root;
	}
}