LeetCode/219.cpp at master · nitin-maharana/LeetCode · 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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

class Solution {
    int len;
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) {
        int len = nums.size();

        unordered_map<int,int> memory;

        for(int i = 0; i < len; i++)
        {
            if(memory.find(nums[i]) != memory.end() && (i - memory[nums[i]]) <= k)
                return true;
            else
                memory[nums[i]] = i;
        }

        return false;
    }

    bool containsNearbyDuplicate1(vector<int>& nums, int k) {
        int len = nums.size();

        unordered_set<int> memory;

        int startIndex, endIndex;

        startIndex = 0;
        endIndex = k;

        for(int i = startIndex; i <= endIndex && i < len; i++)
        {
            if(memory.find(nums[i]) != memory.end())
                return true;
            else
                memory.insert(nums[i]);
        }

        endIndex++;

        while(endIndex < len)
        {
            memory.erase(nums[startIndex]);

            startIndex++;

            if(memory.find(nums[endIndex]) != memory.end())
                return true;
            else
                memory.insert(nums[endIndex]);

            endIndex++;
        }

        return false;
    }
};