219. Contains Duplicate II

最新推荐文章于 2023-12-14 16:42:17 发布

zhouyanz

最新推荐文章于 2023-12-14 16:42:17 发布

阅读量182

点赞数

分类专栏： Leetcode 文章标签： Java LeetCode

本文链接：https://blog.csdn.net/zhouyanz/article/details/50926701

版权

Leetcode 专栏收录该内容

196 篇文章 0 订阅

订阅专栏

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 .

public class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        int [] a =new  int [35000];
        for(int i = 0;i<35000;i++){
            a[i]=-1;
        }
        for(int i = 0;i<nums.length;i++){
            if(a[nums[i]+100]==-1)a[nums[i]+100]=i;else{
                if(i-a[nums[i]+100]<=k)return true;
                a[nums[i]+100]=i;
            }
        }
        return false;
    }
}