Contains Duplicate II

最新推荐文章于 2024-11-12 10:59:16 发布

小灰灰52309

最新推荐文章于 2024-11-12 10:59:16 发布

阅读量308

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/xiaohuihui52309/article/details/52336703

版权

leetcode 专栏收录该内容

185 篇文章 0 订阅

订阅专栏

题目：

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 indices i and j in the array such that nums[i] = nums[j] and the difference between i 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;
    }
};