add 1261

Author: luliyucoordinate

README.md

@@ -565,4 +565,5 @@ LeetCode
 |1257|[Smallest Common Region](https://leetcode.com/contest/biweekly-contest-13/problems/smallest-common-region/)|c|[c++](./src/1257-Smallest-Common-Region/1257.cpp)|[python](./src/1257-Smallest-Common-Region/1257.py)|[go](./src/1257-Smallest-Common-Region/1257.go)|[js](./src/1257-Smallest-Common-Region/1257.js)|[java](./src/1257-Smallest-Common-Region/1257.java)|Medium|
 |1258|[Synonymous Sentences](https://leetcode.com/contest/biweekly-contest-13/problems/synonymous-sentences/)|c|[c++](./src/1258-Synonymous-Sentences/1258.cpp)|[python](./src/1258-Synonymous-Sentences/1258.py)|[go](./src/1258-Synonymous-Sentences/1258.go)|[js](./src/1258-Synonymous-Sentences/1258.js)|[java](./src/1258-Synonymous-Sentences/1258.java)|Medium|
 |1259|[Handshakes That Don't Cross](https://leetcode.com/contest/biweekly-contest-13/problems/handshakes-that-dont-cross/)|c|[c++](./src/1259-Handshakes-That-Don't-Cross/1259.cpp)|[python](./src/1259-Handshakes-That-Don't-Cross/1259.py)|[go](./src/1259-Handshakes-That-Don't-Cross/1259.go)||[java](./src/1259-Handshakes-That-Don't-Cross/1259.java)|Hard|
-|1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)|c|[c++](./src/1260-Shift-2D-Grid/1260.cpp)|[python](./src/1260-Shift-2D-Grid/1260.py)|[go](./src/1260-Shift-2D-Grid/1260.go)|[js](./src/1260-Shift-2D-Grid/1260.js)|[java](./src/1260-Shift-2D-Grid/1260.java)|Easy|
+|1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)|c|[c++](./src/1260-Shift-2D-Grid/1260.cpp)|[python](./src/1260-Shift-2D-Grid/1260.py)|[go](./src/1260-Shift-2D-Grid/1260.go)|[js](./src/1260-Shift-2D-Grid/1260.js)|[java](./src/1260-Shift-2D-Grid/1260.java)|Easy|
+|1261|[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)|c|[c++](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.cpp)|[python](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.py)|[go](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.go)|[js](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.js)|[java](./src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.java)|Medium|

src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.cpp

@@ -0,0 +1,34 @@
+class FindElements 
+{
+public:
+    FindElements(TreeNode* root) 
+    {
+        root->val = 0;
+        data.insert(0);
+        dfs(root);
+    }
+    
+    bool find(int target) 
+    {
+        return data.count(target);
+    }
+    
+private:
+    unordered_set<int> data;
+    
+    void dfs(TreeNode* root) 
+    {
+        if (root->left) 
+        {
+            root->left->val = 2 * root->val + 1;
+            data.insert(root->left->val);
+            dfs(root->left);
+        }
+        if (root->right)
+        {
+            root->right->val = 2 * root->val + 2;
+            data.insert(root->right->val);
+            dfs(root->right);
+        }
+    }
+};

src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.go

@@ -0,0 +1,32 @@
+type FindElements struct {
+    data map[int]int
+}
+
+
+func Constructor(root *TreeNode) FindElements {
+    res := FindElements{data:make(map[int]int)}
+    root.Val, res.data[0] = 0, 1
+    dfs(&res, root)
+    return res
+}
+
+func dfs(this *FindElements, root* TreeNode) {
+    if root.Left != nil {
+        root.Left.Val = 2 * root.Val + 1
+        this.data[root.Left.Val] = 1
+        dfs(this, root.Left)
+    } 
+    if root.Right != nil {
+        root.Right.Val = 2 * root.Val + 2
+        this.data[root.Right.Val] = 1
+        dfs(this, root.Right)
+    }
+}
+
+
+func (this *FindElements) Find(target int) bool {
+    if _, ok := this.data[target]; ok {
+        return true
+    }
+    return false
+}

src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.java

@@ -0,0 +1,26 @@
+class FindElements {
+    public FindElements(TreeNode root) {
+        root.val = 0;
+        data.add(0);
+        dfs(root);
+    }
+    
+    private Set<Integer> data = new HashSet();
+    
+    private void dfs(TreeNode root) {
+        if (root.left != null) {
+            root.left.val = root.val*2 + 1;
+            data.add(root.left.val);
+            dfs(root.left);
+        }
+        if (root.right != null) {
+            root.right.val = root.val*2 + 2;
+            data.add(root.right.val);
+            dfs(root.right);
+        }
+    }
+    
+    public boolean find(int target) {
+        return data.contains(target);
+    }
+}

src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.js

@@ -0,0 +1,30 @@
+/**
+ * @param {TreeNode} root
+ */
+var FindElements = function(root) {
+    this.data = new Set();
+    root.val = 0;
+    this.data.add(0);
+    
+    let dfs = node => {
+        if (node.left) {
+            node.left.val = node.val * 2 + 1;
+            this.data.add(node.left.val);
+            dfs(node.left);
+        }
+        if (node.right) {
+            node.right.val = node.val * 2 + 2;
+            this.data.add(node.right.val);
+            dfs(node.right);
+        }
+    }
+    dfs(root);
+};
+
+/** 
+ * @param {number} target
+ * @return {boolean}
+ */
+FindElements.prototype.find = function(target) {
+    return this.data.has(target);
+};

src/1261-Find-Elements-in-a-Contaminated-Binary-Tree/1261.py

@@ -0,0 +1,23 @@
+class FindElements:
+    def __init__(self, root: TreeNode):
+        root.val = 0
+        def dfs(node):
+            if node.left:
+                node.left.val = 2*node.val + 1
+                dfs(node.left)
+            if node.right:
+                node.right.val = 2*node.val + 2
+                dfs(node.right)
+        dfs(root)
+        self.root = root
+        
+    def find(self, target: int) -> bool:
+        cur = self.root
+        for i in bin(target + 1)[3:]:
+            if not cur:
+                return False
+            if i == '1':
+                cur = cur.right
+            else:
+                cur = cur.left
+        return cur != None

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Shift 2D Grid"
-ID = 1260
-url = "https://leetcode.com/problems/shift-2d-grid/"
-difficult = "Easy"
+name = "Find Elements in a Contaminated Binary Tree"
+ID = 1261
+url = "https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/"
+difficult = "Medium"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']