leetcode:219 Contains Duplicate II－每日编程第三十五题

Contains Duplicate II

Total
Accepted: 38552 Total
Submissions: 137098 Difficulty: Easy

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.

class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
int size=nums.size();
map<int,int> ma;
map<int,int>::iterator it;
for(int i=0;i<size;i++){
if((it=ma.find(nums[i]))!=ma.end()){
if((i-(it->second))<=k){
return true;
}else{
it->second=i;
}
}else{
ma[nums[i]]=i;
}
}
return false;
}
};