leetcode

0 class Solution {

1 public:

2 bool checkIfExist(vector<int> &arr) {

3 unordered_set<int> us;

4 for (int i : arr)

5 if ((i % 2 == 0 && us.find(i / 2) != us.end()) || us.find(i * 2) != us.end())

6 return true;

7 else

8 us.insert(i);

9

10 return false;

11 }

12 };