/*Hash Table*/
class Solution {
public:
bool containsNearbyDuplicate(vector<int>& nums, int k) {
unordered_map<int, int> count;
for(int i = 0; i < nums.size(); ++i){
unordered_map<int, int>::iterator it = count.find(nums[i]);
if(it != count.end()){
int idx = count[nums[i]];
if(i - idx < k + 1) return true;
}
count[nums[i]] = i;
}
return false;
}
};
LeetCode之Contains Duplicate II
最新推荐文章于 2020-02-07 15:16:07 发布