LeetCode: Contains Duplicate II

最新推荐文章于 2020-02-07 15:16:07 发布

wyc1230

最新推荐文章于 2020-02-07 15:16:07 发布

阅读量586

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/wyc1230/article/details/46560213

版权

LeetCode 专栏收录该内容

186 篇文章 0 订阅

订阅专栏

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

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