105. Construct Binary Tree from Preorder and Inorder Traversal

Description:
Given preorder and inorder traversal of a tree, construct the binary tree.
Note:
You may assume that duplicates do not exist in the tree.
分析：这道题是典型的分治问题。 eg.pre:[1,2,4,8,5,3,6,9,7], in:[8,4,2,5,1,9,6,3,7]我们知道1一定是根节点，在in数组中1左边的是左子树，1右边的是右子树。这样一个问题就变成了[2,4,8,5][8,4,2,5]和[3,6,9,7][9,6,3,7]两个小规模问题。我们重载一个buildTree，添加每个数组的起始位置作为参数。
代码如下：

/**
 * 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) {
        if(preorder.empty() || inorder.empty())
            return nullptr;

        return buildTree(preorder, inorder, 0, preorder.size() - 1, 0, inorder.size() - 1);
    }

    TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder, int pb, int pe, int ib, int ie)
    {
        if(pb > pe)
            return nullptr;

        TreeNode* root = new TreeNode(preorder[pb]);
        int offset = 0;

        while(inorder[ib + offset] != preorder[pb])
            offset++;

        root->left = buildTree(preorder, inorder, pb + 1, pb + offset, ib, ib + offset - 1);
        root->right = buildTree(preorder, inorder, pb + offset + 1, pe, ib + offset + 1, ie);

        return root;
    }
};

你必须非常努力，才能显得毫不费力！