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

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].

``````class Solution {
public:
int findPairs(vector<int>& nums, int k) {
int res = 0, n = nums.size();
unordered_map<int, int> m;
for (int num : nums) ++m[num];
for (auto a : m) {
if (k == 0 && a.second > 1) ++res;
if (k > 0 && m.count(a.first + k)) ++res;
}
return res;
}
};
``````

``````class Solution {
public:
int findPairs(vector<int>& nums, int k) {
int res = 0, n = nums.size(), j = 0, pre = INT_MAX;
sort(nums.begin(), nums.end());
for (int i = 1; i < n; ++i){
while (j < i && nums[i] - nums[j] > k) ++j;
if (j != i && pre != nums[j] && nums[i] - nums[j] == k) {
++res;
pre = nums[j];
}
}
return res;
}
};
``````

Github 同步地址：

https://github.com/grandyang/leetcode/issues/532

Minimum Absolute Difference in BST

https://leetcode.com/problems/k-diff-pairs-in-an-array/submissions/

https://leetcode.com/problems/k-diff-pairs-in-an-array/discuss/100104/two-pointer-approach

https://leetcode.com/problems/k-diff-pairs-in-an-array/discuss/100098/Java-O(n)-solution-one-Hashmap-easy-to-understand

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation