Leetcode之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

代码：

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

 

来源：CSDN

作者：一只荣

链接：https://blog.csdn.net/qq_35455503/article/details/103537280