题目链接:https://leetcode.com/problems/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 difference between i and j is at most k.
思路:hash表很容易解决。对于C++开发者来说,用好STL库将会对你效率数倍的提升!
代码如下:
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
unordered_map<int, int> hash;
for(int i = 0; i < nums.size(); i++)
{
if(i > k) hash[nums[i-k-1]]--;
if(hash[nums[i]] > 0) return true;
hash[nums[i]]++;
}
return false;
}
};