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 absolute difference between i and j is at most k.
Example 1:
Input: nums = [1,2,3,1], k = 3
Output: true
分析:
判断数组中是否含有重复元素且下标之间的绝对值是否不大于k。
解法一:暴力法,直接依次遍历数组,存在相同元素并且其索引之差不大于k,返回true,否则返回false。
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
int len = nums.size();
for(int i=0; i<len-1; i++)
{
for(int j=i+1; j<len; j++)
{
if((nums[i] == nums[j]) && (j-i)<=k)
{
return true;
}
}
}
return false;
}
};
解法二:使用unordered_map作存储,遍历数组。如果表中不存在则添加该数字的索引,否则计算找到的索引与此前记录索引的记录,是否小于等于k。
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
unordered_map<int , int> m;
for (int i = 0; i < nums.size(); i++) {
if (m.find(nums[i]) != m.end() && i-m[nums[i]] <= k)
return true;
else
m[nums[i]] = i;
}
return false;
}
};