［LeetCode］Construct Binary Tree from Inorder and Postorder Traversal

解题思路：

分而治之，利用中序和后序遍历的特点 

/**
 * 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>& inorder, vector<int>& postorder) {

        TreeNode* root = NULL;
        build(root, inorder, 0, inorder.size(), postorder, 0, postorder.size());
        return root;
    }

    void build(TreeNode* &root, vector<int>& inorder, int inLeft, int inRight, 
                               vector<int>& postorder, int postLeft, int postRight){
        if (postLeft == postRight) return;

        root = new TreeNode(postorder[postRight-1]);
        auto it = find(inorder.begin() + inLeft, inorder.begin() + inRight, postorder[postRight-1]);

        int inMid = it - inorder.begin();
        int diff = (inorder.begin() + inRight - it);
        int postMid = postRight - diff;

        build(root->left, inorder, inLeft, inMid, postorder, postLeft, postMid);
        build(root->right, inorder, inMid+1, inRight, postorder, postMid, postRight-1);

        return;
    }
};