1319. 包含重复值 II

class Solution:
    """
    @param nums: the given array
    @param k: the given number
    @return:  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
    """
    ‘‘‘
    大致思路:
    1.循环进行切割，判断是否存在重复的值，如果存在，直接返回True，否则返回False，给出一个方法。
    ‘‘‘
    def containsNearbyDuplicate(self,nums,k):
        for i in range(len(nums)-k):
            if self.isSameList(nums[i:i+k+1]) == True:
                return True
        return False
            

    def isSameList(self,l):
        dic = {}
        for i in l:
            dic[i] = dic.get(i,0)+1
        
        for k,v in dic.items():
            if v > 1:
                return True
        return False