leetcode每日一题第157天

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) {
        if(preorder.empty()) return nullptr;
        int leftsize = 0;
        for(auto v:inorder)
        {
            if(v!=preorder[0])
            {
                leftsize++;
            }
            else
            {
                break;
            }
        }
        vector<int> pre1(preorder.begin()+1,preorder.begin()+1+leftsize);
        vector<int> pre2(preorder.begin()+1+leftsize,preorder.end());
        vector<int> in1(inorder.begin(),inorder.begin()+leftsize);
        vector<int> in2(inorder.begin()+leftsize+1,inorder.end());
        TreeNode* left = buildTree(pre1,in1);
        TreeNode* right = buildTree(pre2,in2);
        return new TreeNode(preorder[0],left,right);
    }
};