JZ7_用前序遍历和中序遍历重建二叉树

/**
 * struct TreeNode {
 *	int val;
 *	struct TreeNode *left;
 *	struct TreeNode *right;
 *	TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 * };
 */
#include <unordered_map>
#include <vector>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param preOrder int整型vector 
     * @param vinOrder int整型vector 
     * @return TreeNode类
     */
     TreeNode* reConstructBinaryTreeHelper(unordered_map<int, int>&_hashTable,vector<int>&preOrder, 
                                            int preStart, int preEnd,
                                            int inStart, int inEnd)
    {
        if(preStart > preEnd) return nullptr; //递归终止条件

        int mid = preOrder[preStart];//前序遍历的第一个结点为根结点
        int mid_index = _hashTable[mid]; //从中序遍历表中找到根结点的索引
        int left_count = mid_index - inStart; //中序的根索引的左边所有元素是 左子树的个数
        TreeNode *root = new TreeNode(mid); //开始构造
        //递归构建左子树和右子树：找到前序、中序遍历的左子树和右子树索引范围递归构建root的左右孩子即可
        root->left = reConstructBinaryTreeHelper(_hashTable, preOrder, preStart+1, preStart+left_count,
                                            inStart, mid_index - 1);
        root->right = reConstructBinaryTreeHelper(_hashTable, preOrder, preStart+left_count+1, preEnd,
                                                    mid_index+1, inEnd);

        return root;
    }
    TreeNode* reConstructBinaryTree(vector<int>& preOrder, vector<int>& vinOrder) {
        // write code here
        unordered_map<int, int>_hashTable; //哈希表
        for(int idx = 0; idx < vinOrder.size(); ++idx){
            _hashTable[vinOrder[idx]] = idx;//哈希表存储中序遍历的索引
        }
        //辅助函数构造二叉树
        return reConstructBinaryTreeHelper(_hashTable, preOrder,0, preOrder.size() - 1, 0, vinOrder.size() - 1);
    }
};