剑指Offer-4-重建二叉树之前序中序版

题目描述

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

/**
 * 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) {
        if(pre.length<=0||in.length<=0||pre.length!=in.length){
            return null;
        }
        TreeNode root = reConstructBinary(pre,0,pre.length-1,in,0,in.length-1);
        return root;
    }
    public TreeNode reConstructBinary(int [] pre,int pstart,int pend,int [] in,int istart,int iend){
        if(pstart>pend||istart>iend)
            return null;
        TreeNode root = new TreeNode(pre[pstart]);
        int i = search(in,pre[pstart]);
        root.left = reConstructBinary(pre,pstart+1,pstart+i-istart,in,istart,i-1);
        root.right = reConstructBinary(pre,pstart+i-istart+1,pend,in,i+1,iend);
        return root;
    }
    
    public int search(int [] search,int k){
        int i = 0;
        for(i=0;i<search.length;i++){
            if(k==search[i]){
                break;
            }
        }
        return i;
    }
    
}