Leetcode 532 K-diff Pairs in an Array
2017-10-24 22:44
525 查看
Leetcode 532 K-diff Pairs in an Array
class Solution {
public:
int findPairs(vector<int>& nums, int k) {
//return the number of unique pairs
int pairCount = 0;
unordered_map<int,int> number;
for(int num : nums)
number[num] ++;//要求返回不重复的pair的个数，所以对每个元素进行计数，这样可以去重。
for(auto a : number)
{
if(k == 0 && a.second > 1)
pairCount ++;
if(k > 0 && number.count(a.first + k))
pairCount ++;
}
return pairCount;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode - 532 - K-diff Pairs in an Array
- LeetCode-532：K-diff Pairs in an Array (给定绝对值差的值对个数)
- leetcode532~K-diff Pairs in an Array
- 20170605-leetcode-532-K-diff Pairs in an Array
- [leetcode]-532 K-diff Pairs in an Array
- LeetCode 532 K-diff Pairs in an Array
- Leetcode 532 K-diff Pairs in an Array
- K-diff Pairs in an Array leetcode 532
- leetcode 532. K-diff Pairs in an Array
- 【LeetCode】532. K-diff Pairs in an Array
- [leetcode] 532. K-diff Pairs in an Array
- [leetcode]: 532. K-diff Pairs in an Array
- leetcode 532. K-diff Pairs in an Array
- LeetCode 532. K-diff Pairs in an Array
- [Leetcode]532. K-diff Pairs in an Array
- leetcode--532. K-diff Pairs in an Array
- leetcode 532. K-diff Pairs in an Array 相差为k的元素对
- LeetCode #532 K-diff Pairs in an Array
- Leetcode 532. K-diff Pairs in an Array
- [LeetCode] 532. K-diff Pairs in an Array