532. K-diff Pairs in an Array
2018-04-01 20:19
260 查看
class Solution { public: int findPairs(vector<int>& nums, int k) { if(k<0) return 0; unordered_map<int,int> table; for(int i=0;i<nums.size();i++) { if(table.find(nums[i])==table.end()) table[nums[i]]=1; else table[nums[i]]++; } int ans=0; for( unordered_map<int,int>:: iterator it = table.begin();it!=table.end();it++) { if(table.find(it->first + k)!=table.end()) { if(table.find(it->first + k)==it&&table[it->first + k ]==1) ; else ans++; } } return ans; } };
相关文章推荐
- LeetCode 532. K-diff Pairs in an Array
- LeetCode - 532. K-diff Pairs in an Array
- 532. K-diff Pairs in an Array
- LeetCode-532. K-diff Pairs in an Array
- 532. K-diff Pairs in an Array
- leetcode 532. K-diff Pairs in an Array
- 【leetcode】532. K-diff Pairs in an Array
- LeetCode532. K-diff Pairs in an Array
- Leetcode——532. K-diff Pairs in an Array
- 532. K-diff Pairs in an Array
- [leetcode]: 532. K-diff Pairs in an Array
- leetcode题解-532. K-diff Pairs in an Array
- 双指针 532. K-diff Pairs in an Array
- 532. K-diff Pairs in an Array
- 532. K-diff Pairs in an Array
- 2017.11.22 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的元素对