leetcode——第105题——中序+前序构造二叉树

题目：
根据一棵树的前序遍历与中序遍历构造二叉树。

/**
 * 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 {
private:
    TreeNode* traversal(vector<int>& preorder, vector<int>& inorder, 
        int preorderBegin, int preorderEnd, int inorderBegin, int inorderEnd)
    {
        if(preorderBegin == preorderEnd)
        {
            return nullptr;
        }

        int rootValue = preorder[preorderBegin];
        TreeNode* root = new TreeNode(rootValue);

        if(preorderEnd - preorderBegin == 1)
        {
            return root;
        }

        int delimIndex;
        for(delimIndex = inorderBegin; delimIndex < inorderEnd; delimIndex++)
        {
            if(inorder[delimIndex] == rootValue)
            {
                break;
            }
        }

        // 中序遍历切割
        int leftInorderBegin = inorderBegin;
        int leftInorderEnd = delimIndex;
        int rightInorderBegin = delimIndex+1;
        int rightInorderEnd = inorderEnd;

        // 前序遍历切割
    int leftpreorderBegin = preorderBegin+1;
    int leftpreorderEnd = leftpreorderBegin+leftInorderEnd-leftInorderBegin;
    int rightpreorserBegin=leftpreorderBegin+leftInorderEnd-leftInorderBegin;
    int rightpreorderEnd = preorderEnd;

        // 递归没有写
        root->left = traversal(preorder, inorder, leftpreorderBegin,leftpreorderEnd,leftInorderBegin,leftInorderEnd);
        root->right = traversal(preorder, inorder,rightpreorserBegin,rightpreorderEnd,rightInorderBegin,rightInorderEnd);

        return root;
    }

public:
    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) 
    {
        if(preorder.size() == 0 || inorder.size() == 0)
        {
            return nullptr;
        }
    return traversal(preorder, inorder, 0, preorder.size(), 0, inorder.size());
    }
};