LeetCode C++ 1261. Find Elements in a Contaminated Binary Tree【Tree/Hash Table】中等

Given a binary tree with the following rules:

1. root.val == 0
2. If treeNode.val == x and treeNode.left != null, then treeNode.left.val == 2 * x + 1
3. If treeNode.val == x and treeNode.right != null, then treeNode.right.val == 2 * x + 2

Now the binary tree is contaminated, which means all treeNode.val have been changed to -1.

You need to first recover the binary tree and then implement the FindElements class:

• FindElements(TreeNode* root) Initializes the object with a contamined binary tree, you need to recover it first.
• bool find(int target) Return if the target value exists in the recovered binary tree.

Example 1:

Input:
["FindElements","find","find"]
[[[-1,null,-1]],[1],[2]]
Output:
[null,false,true]
Explanation:
FindElements findElements = new FindElements([-1,null,-1]); 
findElements.find(1); // return False 
findElements.find(2); // return True 

Example 2:

Input:
["FindElements","find","find","find"]
[[[-1,-1,-1,-1,-1]],[1],[3],[5]]
Output:
[null,true,true,false]
Explanation:
FindElements findElements = new FindElements([-1,-1,-1,-1,-1]);
findElements.find(1); // return True
findElements.find(3); // return True
findElements.find(5); // return False

Example 3:

Input:
["FindElements","find","find","find","find"]
[[[-1,null,-1,-1,null,-1]],[2],[3],[4],[5]]
Output:
[null,true,false,false,true]
Explanation:
FindElements findElements = new FindElements([-1,null,-1,-1,null,-1]);
findElements.find(2); // return True
findElements.find(3); // return False
findElements.find(4); // return False
findElements.find(5); // return True

Constraints:

• TreeNode.val == -1
• The height of the binary tree is less than or equal to 20
• The total number of nodes is between [1, 10^4]
• Total calls of find() is between [1, 10^4]
• 0 <= target <= 10^6

题意：给出一个满足下述规则的二叉树：

• root.val == 0
• 如果 treeNode.val == x 且 treeNode.left != null ，那么 treeNode.left.val == 2 * x + 1
• 如果 treeNode.val == x 且 treeNode.right != null ，那么 treeNode.right.val == 2 * x + 2

现在这个二叉树受到「污染」，所有的 treeNode.val 都变成了 -1 。请先还原二叉树，然后实现 FindElements 类：

• FindElements(TreeNode* root) 用受污染的二叉树初始化对象，需要先把它还原。
• bool find(int target) 判断目标值 target 是否存在于还原后的二叉树中并返回结果。

---

解法 递归还原+哈希集合

class FindElements {
private:
    unordered_set<int> rec;
    void rebuild(TreeNode* root, int val) {
        if (root == nullptr) return;
        root->val = val;
        rec.insert(val);
        rebuild(root->left, val * 2 + 1);
        rebuild(root->right, val * 2 + 2);
    }
public:
    FindElements(TreeNode* root) { rebuild(root, 0); }
    bool find(int target) { return rec.find(target) != rec.end(); } //O(1)
};

运行效率如下：

执行用时：40 ms, 在所有 C++ 提交中击败了99.63% 的用户
内存消耗：31.3 MB, 在所有 C++ 提交中击败了42.22% 的用户