leetcode-219

简单的滑动窗口+哈希表，代码写的比较丑

class Solution:
  def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
    k += 1
    table = set()
    f = False
    g = min(k, len(nums))
    for i in range(g):
      if nums[i] in table:
        f = True
        break
      table.add(nums[i])
    if f:
      return True
    for i in range(g, len(nums)):
      table.remove(nums[i - k])
      if nums[i] in table:
        f = True
        break
      table.add(nums[i])
    return f