algorithms

Algorithm implementations
git clone git://git.laack.co/algorithms.git
Log | Files | Refs | README

contains-duplicate.py (446B)

      1 class Solution:
      2     def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
      3         
      4         num_set = set()
      5         left = 0
      6 
      7         for right in range(len(nums)):
      8             
      9             if right - left > k:
     10                 num_set.remove(nums[left])
     11                 left += 1
     12             
     13             if nums[right] in num_set:
     14                 return True
     15             
     16             num_set.add(nums[right])
     17 
     18 
     19         return False