标签：put false list array return self inpu bool diff
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.
Example 1:
Input: nums = [1,2,3,1], k = 3
Output: true
Example 2:
Input: nums = [1,0,1,1], k = 1
Output: true
Example 3:
Input: nums = [1,2,3,1,2,3], k = 2 Output: false
class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: d = {} for i, c in enumerate(nums): if c in d: if k >= (i - d[c]): return True else: d[c] = i else: d[c] = i return False
标签：put false list array return self inpu bool diff
原文地址：https://www.cnblogs.com/boluo007/p/12594783.html
