leetcode/219. Contains Duplicate II.py at master · yunfengzhou-hub/leetcode · GitHub

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
class Solution:
    def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
#        if len(nums)<2: return False
#        k=min(k,len(nums)-1)
#        for i in range(len(nums)-k):
#            for j in range(1,k+1):
#                if nums[i]==nums[i+j]:
#                    return True
#        for i in range(len(nums)-k-1,len(nums)):
#            for j in range(i+1,len(nums)):
#                if nums[i]==nums[j]:
#                    return True
#        return False

#        if len(nums)<2: return False
#        for i in range(1,k+1):
#            for j in range(len(nums)-i):
#                if nums[j]==nums[j+i]: return True
#        return False

        if len(nums)<2: return False
        nums2=[]
        for i in range(len(nums)):
            nums2.append([nums[i],i])
        nums2.sort()
        for i in range(len(nums)-1):
            if nums2[i][0]==nums2[i+1][0] and nums2[i+1][1]-nums2[i][1]<=k:
                return True
        return False