219. Contains Duplicate II （判断数组中是否有重复元素且其下标之差不超过k）

最新推荐文章于 2024-04-02 20:43:27 发布

Alan_Xiang

最新推荐文章于 2024-04-02 20:43:27 发布

阅读量672

点赞数

分类专栏： leetcode LeetCode Solutions In Java 文章标签： leetcode 算法数组

本文链接：https://blog.csdn.net/xiangwanpeng/article/details/52953537

版权

leetcode 同时被 2 个专栏收录

122 篇文章 0 订阅

订阅专栏

LeetCode Solutions In Java

122 篇文章 7 订阅

订阅专栏

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.

import java.util.Hashtable;
public class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		for (int i = 0; i < nums.length; i++) {
			if (map.get(nums[i]) != null&&i - map.get(nums[i]) <= k)
				return true;
			else
				map.put(nums[i], i);
		}
		return false;
    }
}