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].
思路1:
1.(1,3)和(3,1)属于同一对只标记一次,k如果为负数直接返回零,绝对值距离不可能为负值。
2.首先遍历一遍数组并使用unorder_map标记所有数字出现次数,然后遍历map并计数,由于map中key不会出现重复,所以直接统计即可,时间复杂度O(N),空间复杂度O(N)。
3.使用map做判断语句时,不可以使用if(map[it->first+k]>0).而应该用find函数!!
参考代码:
class Solution {
public:
int findPairs(vector<int>& nums, int k) {
unordered_map<int,int> mp;
if(k<0) return 0;
int n=nums.size(),ans=0;
for(int i=0;i<n;++i){
mp[nums[i]]++;
}
for(auto it=mp.begin();it!=mp.end();++it){
if(k==0&&it->second>=2)
ans++;
else if(k!=0&&mp.find((it->first)+k)!=mp.end())
ans++;
}
return ans;
}
};
思路2:
1.使用two pointers 当nums[j]-nums[i]恒等于k时,计数器加一,i,j同时后移;当nums[j]-nums[i]>k时,i后移,当nums[j]-nums[i]小于k时,j后移,for()循环中j=max(j,i+1)是为了防止k=0时,i,j指向同一个数字会使计数器误加一。
2.时间复杂度:O(nlogn),空间复杂度O(1)
参考代码:
class Solution {
public:
int findPairs(vector<int>& nums, int k) {
sort(nums.begin(),nums.end());
int ans=0;
for(int i=0,j=1;i<nums.size()-1&&j<nums.size();j=max(j,i+1)){
if(nums[j]-nums[i]==k){
ans++;
while(i<nums.size()-1&&nums[i]==nums[i+1]) ++i;
++i;
while(j<nums.size()&&nums[j]==nums[j+1]) ++j;
++j;
}else if(nums[j]-nums[i]>k){
while(i<nums.size()-1&&nums[i]==nums[i+1]) ++i;
++i;
}else{
while(j<nums.size()&&nums[j]==nums[j+1]) ++j;
++j;
}
}
return ans;
}
};