532. K-diff Pairs in an Array

Problem 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:

1. The pairs (i, j) and (j, i) count as the same pair.
2. The length of the array won't exceed 10,000.
3. All the integers in the given input belong to the range: [-1e7, 1e7].

Analysis:

本题需要考虑三种情况，一种是当k为负数，0，正数的情况。负数的时候直接返回0； 当为0的时候则查询数组有多少重复的元素；当为正数的时候则遍历数组找到符合Absolute difference为k的所有数对。代码如下：

Code:

class Solution {
    public int findPairs(int[] nums, int k) {
        if(k < 0)
            return 0;
        Arrays.sort(nums);
        int cnt = 0;
        
        if(k == 0) {
            int tmp = 0;
            for(int i = 0; i < nums.length; i++) {
                if(i > 0 && nums[i] == nums[i - 1]) {
                    while(i + 1 < nums.length && nums[i] == nums[i + 1]) {
                        i++;
                    }
                    tmp++;
                }
            }
            return tmp;
        }
        for(int i = 0; i < nums.length; i++) {
            if(i > 0 && nums[i] == nums[i - 1]) continue;
            for(int j = i + 1;  j < nums.length; j++) {
                if(nums[j] - nums[i] == k) {
                    cnt++;
                    break;
                } else if(nums[j] - nums[i] > k) {
                    break;
                }
            }
        }
        return cnt;
    }
}