Leetcode 532

题目：
https://leetcode.com/problems/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).

Solution1:
思路:分情况讨论k < 0., = 0, > 0 的情况

public int findPairs(int[] nums, int k) {
        int sol = 0;
        Set<Integer> hash = new HashSet<>();
        if (k < 0) {
            return sol;
        }
        else if (k == 0) {
            Set<Integer> counted = new HashSet<>();
            for (int num : nums) {
                if (hash.contains(num) && !counted.contains(num)) {
                    sol++;
                    counted.add(num);
                }
                else {
                    hash.add(num);
                }
            }
            return sol;
        }
        
        for (int num : nums) {
            hash.add(num);
        }
        for (int num : hash) {
            if (hash.contains(num + k)) {
                sol++;
            }
        }
        return sol;
    }

复杂度：
Time： O(n)
Space: O(n)

优化代码：
复杂度不变

        if (nums == null || nums.length == 0 || k < 0)   {
        	return 0;
        }
        
        Map<Integer, Integer> map = new HashMap<>();
        int count = 0;
        for (int i : nums) {
            map.put(i, map.getOrDefault(i, 0) + 1);
        }
        
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (k == 0) {
                //count how many elements in the array that appear more than twice.
                if (entry.getValue() >= 2) {
                    count++;
                } 
            } else {
                if (map.containsKey(entry.getKey() + k)) {
                    count++;
                }
            }
        }        
        return count;