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.
class Solution(object):
def containsNearbyDuplicate(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: bool
"""
dic = {}
for i, v in enumerate(nums):
if v in dic and i-dic[v]<=k:
return True
dic[v] = i
return False
1 涉及到index和value，想到enumerate
2 再结合字典使用，将index和value一个一个存到字典中，当遍历到下一个时，如果之前存在相同的值，则再判断他们时间的绝对值，看是否小于等于k
