LeetCodeSandbox/217_Contains_Duplicate.cpp at main · oabouelleil/LeetCodeSandbox · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include "LCUtils/Includes/LCIncludes.h"
#include "LCUtils/Includes/LCUtils.h"

#define RUN_SOLUTION 0

/**
 * Solution 0 - Hash Set
 * Time Complexity: O(N)
 * Space Complexity: O(N)
 */
#if RUN_SOLUTION == 0

class Solution {
public:
    bool containsDuplicate(vector<int> &nums) {
        unordered_set<int> visited;
        for (const auto &num: nums) {
            if (!visited.insert(num).second) return true;
        }
        return false;
    }
};

#endif

int main() {
    Solution sol;
    vector<int> nums;

    nums = {1, 2, 3, 1};
    LC::print("Parameter 1: ", nums);
    LC::print("Solution", sol.containsDuplicate(nums));

    nums = {1, 2, 3, 4};
    LC::print("Parameter 1: ", nums);
    LC::print("Solution", sol.containsDuplicate(nums));

    nums = {1, 1, 1, 3, 3, 4, 3, 2, 4, 2};
    LC::print("Parameter 1: ", nums);
    LC::print("Solution", sol.containsDuplicate(nums));

    return 0;
}