532. 数组中的 k-diff 数对

class Solution:
    def findPairs(self, nums: List[int], k: int) -> int:
        res = set()
        seen = set()
        for i, num in enumerate(nums):
            if num - k in seen:
                res.add((num - k, num))
            if num + k in seen:
                res.add((num, num + k))                
            seen.add(num)  # 防止算了自身，后面用个新的集合表示
        return len(res)