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
Example 2:
Input: nums = [1,0,1,1], k = 1 Output: true
Example 3:
Input: nums = [1,2,3,1,2,3], k = 2 Output: false
解题思路:
两个for 肯定超时。
采用map,将nums中的每个数与map中的对比,序号差小于k即return true。
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
map<int,int> m;
for(int i=0;i<nums.size();i++)
{
if(m[nums[i]]>0&&i+1-m[nums[i]]<=k)
{
return true;
}
else
{
m[nums[i]]=i+1;
}
}
return false;
}
};