剑指offer-07:二叉树的重建

思路：确定左右树的范围，如果树对应的数组为0，返回空

class Solution {
public:
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
       return build(preorder,0,preorder.size()-1,inorder,0,inorder.size()-1); 
    }
    TreeNode* build(vector<int>& preorder,int l1,int r1, vector<int>& inorder,int l2,int r2){
        if(l1>r1) return NULL;

        TreeNode* root=new TreeNode(preorder[l1]);
        int i=l2;
        for(;i<r2;i++){
            if(inorder[i]==preorder[l1])
            break;
        }
        root->left=build(preorder,l1+1,l1+i-l2,inorder,l2,i-1);
        root->right=build(preorder,l1+i-l2+1,r1,inorder,i+1,r2);
        return root;
    }
};