首页 > itarticle > leetcode-219题:contains duplicateii

leetcode-219题:contains duplicateii

admin 11月 11, 2020 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.

代码

class Solution(object):
    def containsNearbyDuplicate(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: bool
        """
        if nums==None or len(nums)<2 or k<1:
            return False
        num_indices = {}
        for i,n in enumerate(nums):
            if n not in num_indices:
                num_indices[n] = i
            else:
                if i-num_indices[n] <= k:
                        return True
                num_indices[n] = i
        return False