[leetcode 220]Contains Duplicate III

Given an array of integers, find out whether there are two distinct indices i and j in
the array such that the difference between nums[i] and nums[j] is
at most t and
the difference between i and j is
at most k.

查找一个数组中是否存在两个元素，nums[i]和nums[j]，其中两个元素的的差的绝对值|nums[i]-nums[j]|<=t,两个元素的下标|i-j|<=k.

建立下标与元素的映射关系，然后查找就好了。。。。

AC代码：

class Solution {
public:
bool containsNearbyAlmostDuplicate(vector<int>& nums, int k, int t) {
if(k<=0||t<0)
return false;
int sum=nums.size();
if(sum<=1)
return false;
map<int,int> m;
int j=0;
for(int i=0;i<sum;++i)
{
if(i-j>k&&m[nums[j]]==j)
m.erase(nums[j++]);
map<int,int>::iterator ite=m.lower_bound(nums[i]-t);
if(ite!=m.end()&&abs(ite->first-nums[i])<=t)
return true;
m[nums[i]]=i;
}
return false;
}
};

其他leetcode题目AC代码：https://github.com/PoughER