K-diff Pairs in an Array

题目地址：https://leetcode.com/problems/k-diff-pairs-in-an-array/#/description

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就把它放到HashMap中，这样可以过滤掉重复的组合，代码实现如下：

public class KdiffPairsinanArray {
    public static int findPairs(int[] nums, int k) {
        if (nums.length <= 1)
            return 0;

        if (k < 0)
            return 0;

        TreeMap<Integer, Integer> map = new TreeMap<>();

        for (int i = 0; i < nums.length; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                if (Math.abs(nums[i] - nums[j]) == k) {
                    if (nums[i] < nums[j]) {
                        map.put(nums[i], nums[j]);
                    } else {
                        map.put(nums[j], nums[i]);
                    }
                }
            }
        }

        return map.size();
    }

    public static void main(String[] args) {
        int[] arr = {1, 3, 1, 5, 4};
        System.out.println(findPairs(arr, 0));
    }
}

以上算法的时间复杂度为O(n^2)，这还不算对TreeMap的操作。下面这个方法要比上面的效率要高一些，首先还是将数组中的元素存储在HashMap中，并计数。但是这次除了对HashMap的操作，我们只对数组中的元素做了两次扫描，所以时间复杂度属于O(n)级的：

public class KdiffPairsinanArray {
    public static int findPairs(int[] nums, int k) {
        if (nums.length <= 1)
            return 0;

        if (k < 0)
            return 0;

        HashMap<Integer, Integer> map = new HashMap<>();

        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(nums[i]))
                map.put(nums[i], map.get(nums[i]) + 1);
            else
                map.put(nums[i], 1);
        }

        int cnt = 0;
        for (Map.Entry<Integer, Integer> e : map.entrySet()) {
            if (k == 0) {
                if (e.getValue() >= 2)
                    cnt++;
            } else {
                if (map.containsKey(e.getKey() + k))
                    cnt++;
            }
        }

        return cnt;
    }

    public static void main(String[] args) {
        int[] arr = {1, 3, 1, 5, 4};
        System.out.println(findPairs(arr, 0));
    }
}