Contains Duplicate II

题目：

Contains Duplicate II

• Total Accepted: 72866
• Total Submissions: 237922
• Difficulty: Easy

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

Subscribe to see which companies asked this question

分析：使用unordered_map，并判断距离是否满足条件

代码：

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