532. K-diff Pairs in an Array -- Python

532. K-diff Pairs in an Array

Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both numbers in the array and their absolute difference is k.

Example 1:

Input: [3, 1, 4, 1, 5], k = 2
Output: 2
Explanation: There are two 2-diff pairs in the array, (1, 3) and (3, 5).
Although we have two 1s in the input, we should only return the number of unique pairs.

Example 2:

Input:[1, 2, 3, 4, 5], k = 1
Output: 4
Explanation: There are four 1-diff pairs in the array, (1, 2), (2, 3), (3, 4) and (4, 5).

Example 3:

Input: [1, 3, 1, 5, 4], k = 0
Output: 1
Explanation: There is one 0-diff pair in the array, (1, 1).

Note:

• The pairs (i, j) and (j, i) count as the same pair.

• The length of the array won’t exceed 10,000.

• All the integers in the given input belong to the range: [-1e7, 1e7].

思路：
刚开始没完全明白题目，忽略了 k<0 的这种情况，然后最麻烦的就是 k == 0 时，这里只要得到nums中有多少种元素是重复的即可。

我的代码:(思路正确，但效率太低，超时，未被接受)

class Solution:
    def findPairs(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        count=0
        # set完再转换成list花费了一定的时间，这步是不必要的
        list_nums = list(set(nums))
        if k == 0:
            for each in list_nums:
                if nums.count(each)>1:
                    count+=1
            return count
        elif k < 0:
            return 0
        elif k > 0:
            #在字典中直接遍历元素更简洁，明了
            for i in range(len(list_nums)):
                if list_nums[i]+k in list_nums:
                    count+=1
        return count

然后对我的代码进行简单修改（就被接受了，92 ms，打败了47.5%）：

class Solution:
    def findPairs(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        count=0
        list_nums = set(nums)
        if k == 0:
            for each in list_nums:
                if nums.count(each)>1:
                    count+=1
            return count
        elif k < 0:
            return 0
        elif k > 0:
            for i in list_nums:
                if i+k in list_nums:
                    count+=1
        return count

我的代码2： （又快了一点，73ms，打败了87.8%）

class Solution:
    def findPairs(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        import collections
        count = 0
        list_nums = set(nums)
        if k == 0:
            nums = collections.Counter(nums)
            for each in nums:
                if nums[each] > 1:
                    count += 1
            return count
        elif k < 0:
            return 0
        elif k > 0:
            for i in list_nums:
                if i + k in list_nums:
                    count += 1
            return count

参考代码2：

class Solution:
    def findPairs(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: int
        """
        if k < 0:
            return 0
        if k == 0:
            total = 0
            nums = collections.Counter(nums)
            for n in nums:
                if nums[n] > 1:
                    total += 1
            return total
        nums = set(nums)
        total = 0
        for n in nums:
            if n+k in nums:
                total+=1
        return total