219. Contains Duplicate II

最新推荐文章于 2024-01-10 13:29:44 发布

原创最新推荐文章于 2024-01-10 13:29:44 发布 · 160 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Contains Duplicate I

Leet Code 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种使用哈希映射解决数组中寻找相隔不超过k个位置的重复元素的方法，并提供了一个Java实现示例。

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

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.

Subscribe to see which companies asked this question.

Solution:

Tips:

map, set

Java Code:

public class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        Map<Integer, Integer> mii = new HashMap<>();
        
        for (int i = 0; i < nums.length; i++) {
            if (mii.containsKey(nums[i]) && i - mii.get(nums[i]) <= k) {
                return true;
            }
            mii.put(nums[i], i);
        }
        
        return false;
    }
}