feat: add solutions to lc problem: No.1346. Check If N and Its Double

Exist

Author: yanglbme

solution/1300-1399/1346.Check If N and Its Double Exist/README.md

@@ -60,15 +60,55 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def checkIfExist(self, arr: List[int]) -> bool:
+        map = collections.defaultdict(int)
+        for i, num in enumerate(arr):
+            map[num] = i
+        for i, num in enumerate(arr):
+            if num << 1 in map and i != map[num << 1]:
+                return True
+        return False
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public boolean checkIfExist(int[] arr) {
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int i = 0; i < arr.length; i++) {
+            map.put(arr[i], i);
+        }
+        for (int i = 0; i < arr.length; i++) {
+            if (map.containsKey(arr[i] << 1) && i != map.get(arr[i] << 1))
+                return true;
+        }
+        return false;
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool checkIfExist(vector<int>& arr) {
+        unordered_map<int, int> map;
+        for (int i = 0; i < arr.size(); ++i) {
+            map[arr[i]] = i;
+        }
+        for (int i = 0; i < arr.size(); ++i) {
+            if (map.find(arr[i] * 2) != map.end() && i != map[arr[i] * 2]) {
+                return true;
+            }
+        }
+        return false;
+    }
+};
 ```
 
 ### **...**

solution/1300-1399/1346.Check If N and Its Double Exist/README_EN.md

@@ -55,13 +55,53 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def checkIfExist(self, arr: List[int]) -> bool:
+        map = collections.defaultdict(int)
+        for i, num in enumerate(arr):
+            map[num] = i
+        for i, num in enumerate(arr):
+            if num << 1 in map and i != map[num << 1]:
+                return True
+        return False
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public boolean checkIfExist(int[] arr) {
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int i = 0; i < arr.length; i++) {
+            map.put(arr[i], i);
+        }
+        for (int i = 0; i < arr.length; i++) {
+            if (map.containsKey(arr[i] << 1) && i != map.get(arr[i] << 1))
+                return true;
+        }
+        return false;
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool checkIfExist(vector<int>& arr) {
+        unordered_map<int, int> map;
+        for (int i = 0; i < arr.size(); ++i) {
+            map[arr[i]] = i;
+        }
+        for (int i = 0; i < arr.size(); ++i) {
+            if (map.find(arr[i] * 2) != map.end() && i != map[arr[i] * 2]) {
+                return true;
+            }
+        }
+        return false;
+    }
+};
 ```
 
 ### **...**

solution/1300-1399/1346.Check If N and Its Double Exist/Solution.cpp

@@ -0,0 +1,15 @@
+class Solution {
+public:
+    bool checkIfExist(vector<int>& arr) {
+        unordered_map<int, int> map;
+        for (int i = 0; i < arr.size(); ++i) {
+            map[arr[i]] = i;
+        }
+        for (int i = 0; i < arr.size(); ++i) {
+            if (map.find(arr[i] * 2) != map.end() && i != map[arr[i] * 2]) {
+                return true;
+            }
+        }
+        return false;
+    }
+};

solution/1300-1399/1346.Check If N and Its Double Exist/Solution.java

@@ -1,13 +1,11 @@
-import java.util.*;
-
 class Solution {
     public boolean checkIfExist(int[] arr) {
         Map<Integer, Integer> map = new HashMap<>();
         for (int i = 0; i < arr.length; i++) {
             map.put(arr[i], i);
         }
         for (int i = 0; i < arr.length; i++) {
-            if (map.containsKey(arr[i] * 2) && i != map.get(arr[i] * 2))
+            if (map.containsKey(arr[i] << 1) && i != map.get(arr[i] << 1))
                 return true;
         }
         return false;

solution/1300-1399/1346.Check If N and Its Double Exist/Solution.py

@@ -0,0 +1,9 @@
+class Solution:
+    def checkIfExist(self, arr: List[int]) -> bool:
+        map = collections.defaultdict(int)
+        for i, num in enumerate(arr):
+            map[num] = i
+        for i, num in enumerate(arr):
+            if num << 1 in map and i != map[num << 1]:
+                return True
+        return False