题目:输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回
代码:
package test;
class Solution2 { private static int[] lp = {1,2,4,7,3,5,6,8}; private static int[] lc = {4,7,2,1,5,3,8,6}; private static int index = 0; public Node findRoot(int cstart,int cend,Node node){ if(index == lp.length){ return node; } for(int i=cstart;i