LeetCode--No.219--Contains Duplicate II--有个地方不太懂

最新推荐文章于 2023-08-13 22:18:28 发布

sophia_tone2w

最新推荐文章于 2023-08-13 22:18:28 发布

阅读量225

点赞数

分类专栏： LeetCode--Easy

本文链接：https://blog.csdn.net/sophia_tone2w/article/details/52236836

版权

LeetCode--Easy 专栏收录该内容

60 篇文章 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.

Subscribe to see which companies asked this question
这个问题真是流弊啊，绞尽脑汁想到用map。。。最后还是超时了。

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

改良后的：

public class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        HashMap<Integer, Integer> map = new HashMap<>();
        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;
    }
}

其实还是有点不太懂，为什么第一种情况会超时，第二种就不会。要是有大神看到了，拜托告诉我一下呀！