LeetCode 219 Contains Duplicate II

最新推荐文章于 2023-05-06 11:00:46 发布

原创最新推荐文章于 2023-05-06 11:00:46 发布 · 215 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 题解 C++版专栏收录该内容

138 篇文章

订阅专栏

本文详细解析了LeetCode上ContainsDuplicateII题目，探讨如何判断数组中是否存在两个不同的索引i和j，使得nums[i]=nums[j]且|i-j|≤k。提供了两种解决方案：一种使用unordered_map维护元素出现的位置，另一种利用unordered_set动态维护长度为k的窗口内的元素，以实现高效查找。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Contains Duplicate II - LeetCode

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 absolute difference between i and j is at most k.

Example 1:

Input: nums = [1,2,3,1], k = 3
Output: true

Example 2:

Input: nums = [1,0,1,1], k = 1
Output: true

Example 3:

Input: nums = [1,2,3,1,2,3], k = 2
Output: false

暴力

class Solution {
public:
    bool containsNearbyDuplicate(vector<int>& nums, int k) 
    {
        unordered_map<int, pair<int, int>> m;
        for (int i = 0; i < nums.size(); i ++ ) {
            int num = nums[i];
            if (!m[num].first) m[num].first = i + 1;
            else if (!m[num].second) m[num].second = i + 1;
            else if ((i - m[num].second) < (m[num].second - m[num].first)) {
                m[num].first = m[num].second, m[num].second = i + 1;
            }
        }
        for (auto it : m) {
            pair<int, int> p = it.second;
            if (p.second && p.second - p.first <= k) return true;
        }
        return false;
    }
};

set维护一个长度为k的区间

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