-
Notifications
You must be signed in to change notification settings - Fork 5
/
Contains_Duplicate_II.py
43 lines (35 loc) · 1016 Bytes
/
Contains_Duplicate_II.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
"""
Done by >> Anand Kothari
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(object):
def containsNearbyDuplicate(self, nums, k):
"""
:type nums: List[int]
:type k: int
:rtype: bool
"""
check = set()
for i in range(len(nums)):
if i > k:
check.remove(nums[i - k - 1])
if nums[i] in check:
return True
else:
check.add(nums[i])
return False
if __name__ == '__main__':
s= Solution()
Result= s.containsNearbyDuplicate([1,2,3,1,2,3],2)
if Result != True:
print (False)
else:
print (True)