Leetcode 105. 从前序与中序遍历序列构造二叉树

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder,int prel,int prer,int il,int ir) {//[)
        if(prel==prer) return NULL;
        TreeNode* root=new TreeNode(preorder[prel]);
        int k=find(inorder.begin()+il,inorder.begin()+ir,preorder[prel])-inorder.begin();
        root->left=buildTree(preorder,inorder,prel+1,k-il+prel+1,il,k);
        root->right=buildTree(preorder,inorder,k-il+prel+1,prer,k+1,ir);
        return root;
    }
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        return buildTree(preorder,inorder,0,preorder.size(),0,inorder.size());
    }
};