K-diff Pairs in an Array
Given an array of integers nums and an integer k, return the number of unique k-diff pairs in the array.
A k-diff pair is an integer pair (nums[i], nums[j]), where the following are true:
0 <= i, j < nums.lengthi != j|nums[i] - nums[j]| == k
Notice that |val| denotes the absolute value of val.
Example 1
Input
nums = [3,1,4,1,5], k = 2Output
2There are two 2-diff pairs in the array, (1, 3) and (3, 5), and duplicate values do not create additional unique pairs.
Example 2
Input
nums = [1,2,3,4,5], k = 1Output
4There are four 1-diff pairs in the array: (1, 2), (2, 3), (3, 4), and (4, 5).
Constraints
- 1 <= nums.length <= 10^4
- -10^7 <= nums[i] <= 10^7
- 0 <= k <= 10^7