【LeetCode】219 Contains Duplicate II

最新推荐文章于 2024-03-28 23:22:33 发布

原创最新推荐文章于 2024-03-28 23:22:33 发布 · 321 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种使用HashSet解决数组中是否存在两个不同索引位置的元素相同且索引差不超过k的问题的方法。通过设定滑动窗口大小为k+1，利用HashSet进行元素存储与查找，实现高效判断。

摘要生成于 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 difference between i and j is at most k.

Summary:
Firstly, i considerd the HashSet,but i ran into a problem that i can’t get the indecies of element. Then , i gave it off. Afterwards, i tried to use List,Map ,Array. The complexities of those is too high. Finally, i asked for a favor in the internet and completed my solution.

public class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        int start = 0;
        int end = 0;
        Set<Integer> set  = new HashSet<Integer>();
        for(int i = 0; i < nums.length ; i++){
            if(set.add(nums[i])){
                end++;
            }else{
                return true;
            }
            if(end - start > k){
                set.remove(nums[start]);
                start++;
            }
        }
        return false;
    }
}