blob: 9af77589e04b60720e55c3e2101332b2d5c59fff (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
#include "leetcode.h"
class Solution {
public:
bool containsNearbyDuplicate(vector<int> &nums, int k) {
unordered_map<int, int> um;
for (int i = 0; i < nums.size(); i++) {
if (um.count(nums[i]))
if (abs(i - um[nums[i]]) <= k)
return true;
um[nums[i]] = i;
}
return false;
}
};
int main() {
Solution obj;
vector<int> nums = {1, 2, 3, 1};
if (obj.containsNearbyDuplicate(nums, 3))
cout << "true";
else
cout << "false";
}
|