K-diff Pairs in an Array Solutions in Python

Number 532

Difficulty Easy

Acceptance 31.6%

Other languages Go

Solutions

Python solution by haoel/leetcode

def findPairs(self, nums, k):
    if k > 0:
        return len(set(nums) & set(a + k for a in nums))
    elif k == 0:
        return sum(v > 1 for v in collections.Counter(nums).values())
    return 0

def findPairs(self, nums, k):
    if k > 0:
        return len(set(nums) & set(a + k for a in nums))
    elif k == 0:
        return sum(v > 1 for v in collections.Counter(nums).values())
    return 0