更新时间:2022-10-03 13:44:05
219. Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j]and the difference between i and j is at most k.
题目大意:
找到数组中两个相同元素,如果这两个元素的距离小于等于k,则返回true。如果任意两个相同元素的距离都大于k,或者没有两个元素是相同的,那么返回false。
代码如下:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
|
class Solution {
public :
bool containsNearbyDuplicate(vector< int >& nums, int k) {
unordered_map< int , int > myMap;
for ( int i = 0;i < nums.size();i++)
{
if (myMap.find(nums[i]) == myMap.end())
{
myMap.insert(pair< int , int >(nums[i],i));
}
else
{
if (i - myMap[nums[i]] <= k)
{
return true ;
}
else
myMap[nums[i]] = i;
}
}
return false ;
}
};
|