LeetCode 풀기 - 532. K-diff Pairs in an Array

532. K-diff Pairs in an Array

https://leetcode.com/problems/k-diff-pairs-in-an-array/

K-diff Pairs in an Array - LeetCode

문제)

솔루션1)

시간 복잡도 : O(n)

class Solution:
    def findPairs(self, nums: List[int], k: int) -> int:
        counter = Counter(nums)
        res = 0
        for num, freq in counter.items():
            if k == 0:
                if freq > 1:
                    res += 1                
            else:
                if (num + k) in counter:
                    res += 1
        return res