剑指offer7--重建二叉树——java/C++实现

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

主要是分治的思想

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* fun(vector<int>& pre,vector<int>& vin,int pleft,int inleft,int len){
        if(len==0)
            return NULL;
        TreeNode* node=new TreeNode(pre[pleft]);//这句必须在len==0之后，否则会因为访问了pre数组（空的）而报错

        if(len==1)
            return node;
        int pos=0;
        for(int i=inleft;i<len+inleft;i++){//注意这里，必须是len+inleft
            if(vin[i]==pre[pleft]){
                pos=i;
                break;
            }
        }
        int lenleft=pos-inleft;
        node->left=fun(pre,vin,pleft+1,inleft,lenleft);
        node->right=fun(pre,vin,pleft+1+lenleft,pos+1,len-lenleft-1);//这里必须是len-lenleft-1
        return node;
    }

    TreeNode* reConstructBinaryTree(vector<int> pre,vector<int> vin) {
        TreeNode* root=new TreeNode(0);
        root=fun(pre,vin,0,0,vin.size());
        return root;
    }
};

/**
 * 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) {
        TreeNode root = new TreeNode(0);
        root = doReConstructBinaryTree(pre,in,0,0,in.length);
        return root;
    }
    
    public TreeNode doReConstructBinaryTree(
        int [] pre,
        int [] in,
        int preLeft,
        int inLeft,
        int length){
        if(length==0){
            return null;
        }
        TreeNode node = new TreeNode(pre[preLeft]);
        if(length==1){
            return node;
        }
        int middleValue = pre[preLeft];
        int i=inLeft;
        for(;i<inLeft+length;i++){
            if(in[i]==middleValue){
               break;
            }
        }
        int lenLeft = i-inLeft;
        node.left = doReConstructBinaryTree(pre,in,preLeft+1,inLeft,lenLeft);
        node.right = doReConstructBinaryTree(pre,in,preLeft+lenLeft+1,i+1,length-lenLeft-1);
        
        return node;
    }
}