LeetCode 219. Contains Duplicate II

算法菜鸟今天开始正式刷LeetCode希望能坚持下去

题目：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 jis
at most k.

难度：Easy

总结：

主要熟悉map的基本用法

map的定义 std::map<int,int> data

map插入数据 map[10]="hello"

map的迭代器std::map<int,int>::iterator it

使用两个for循环的话会超时

Runtime: 72
ms

AC代码

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

}
};