[LeetCode]219. Contains Duplicate II

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

题目解析：这道题目是前一道题目的进阶，这里除了寻找相同元素之外，同时还要求相同元素之间的下标距离不能大于k，如果大于k,同样返回false.

思路:

• 1、利用昨天那道题目的思路，利用map来寻找相同的值，在找到相同值的同时来判断他们下标之间的差值与k之间的大小关系。

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