【LeetCode】 219. Contains Duplicate II

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

LSF_Kevin

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

阅读量173

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_31129455/article/details/53826812

版权

LeetCode 专栏收录该内容

217 篇文章 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) {
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < nums.length; i++) {
            Integer temp = map.get(nums[i]);
            if (temp == null) {
                map.put(nums[i], i);
            } else {
                if (i - temp > k) {
                    map.put(nums[i], i);
                } else {
                    return true;
                }
            }
        }
        return false;
    }
}