LeetCode刷题【Array】 Contains Duplicate II

最新推荐文章于 2019-06-12 16:16:26 发布

SimonCode

最新推荐文章于 2019-06-12 16:16:26 发布

阅读量269

点赞数

分类专栏： LeetCode 文章标签： Array leetcode

本文链接：https://blog.csdn.net/ltxiaoxia/article/details/62513497

版权

LeetCode 专栏收录该内容

49 篇文章 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 absolute difference between i and j is at most k.

解决方法一：Runtime: 23 ms

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.containsKey(nums[i])&&(i-map.get(nums[i])<=k)){
                return true;
            }
            map.put(nums[i],i);
        }
        return false;
    }
}

参考：

【1】https://leetcode.com/