class Solution:
    def findPairs(self, nums: List[int], k: int) -> int:
        s=set(nums)
        output=0
        if k==0:
            for i in s:
                if nums.count(i)>1:
                    output+=1
        else:
            for i in s:
                if i+k in s:
                    output+=1
        return output