-
Notifications
You must be signed in to change notification settings - Fork 0
/
contains_duplicate3.cpp
83 lines (77 loc) · 2.43 KB
/
contains_duplicate3.cpp
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
/*
* =====================================================================================
*
* Filename: contains_duplicate3.cpp
*
* Description: Contains Duplicate III. Given an array of integers, find out whether
* there are two distinct indices i and j in the array such that the
* absolute difference between nums[i] and nums[j] is at most t and the
* absolute difference between i and j is at most k.
*
* Version: 1.0
* Created: 03/12/19 02:16:15
* Revision: none
* Compiler: gcc
*
* Author: Zhu Xianfeng (), [email protected]
* Organization:
*
* =====================================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <vector>
#include <unordered_map>
class Solution
{
public:
bool containsNearbyAlmostDuplicate(std::vector<int>& nums, int k, int t)
{
auto contain_func = [](const std::unordered_map<int64_t, int64_t>& values,
int64_t bucket, int64_t target, int t) -> bool {
auto iter = values.find(bucket);
return ((iter != values.end()) && (std::abs(target - iter->second) <= t));
};
if (t < 0)
{
return false;
}
std::unordered_map<int64_t, int64_t> values;
for (int i = 0; i < nums.size(); i++)
{
int64_t target = (int64_t)nums[i] - INT_MIN;
int64_t bucket = target / ((int64_t)t + 1);
if (contain_func(values, bucket, target, t) ||
contain_func(values, bucket - 1, target, t) ||
contain_func(values, bucket + 1, target, t))
{
return true;
}
values[bucket] = target;
if (i >= k)
{
bucket = ((int64_t)nums[i - k] - INT_MIN) / ((int64_t)t + 1);
values.erase(bucket);
}
}
return false;
}
};
int main(int argc, char* argv[])
{
std::vector<int> nums = {1, 5, 9, 1, 5, 9};
int k = 2;
int t = 3;
if (argc > 2)
{
nums.clear();
for (int i = 1; i < argc; i++)
{
nums.push_back(atoi(argv[i]));
}
}
auto is_dup = Solution().containsNearbyAlmostDuplicate(nums, k, t);
printf("Contains duplicate? %s\n", (is_dup ? "Yes" : "No"));
return 0;
}