[LeetCode]532. K-diff Pairs in an Array
来源:互联网 发布:音乐编辑合成软件 编辑:程序博客网 时间:2024/06/05 22:45
[LeetCode]532. K-diff Pairs in an Array
题目描述
思路
哈希,计数
如果k为负,直接返回0
如果k为0,即为求重复元素
代码
#include <iostream>#include <unordered_map>#include <vector>#include <algorithm>using namespace std;class Solution {public: int findPairs(vector<int>& nums, int k) { int res = 0; if (k < 0) return res; unordered_map<int, int> um; for (int num : nums) um[num]++; for (auto p : um) { if (k == 0) { if (p.second > 1) res += 1; } else { if (um.count(p.first + k)) res += 1; } } return res; }};int main() { vector<int> nums = { 1,2,3,4,5 }; Solution s; cout << s.findPairs(nums, -1) << endl; system("pause"); return 0;}
阅读全文
0 0
- LeetCode K-diff Pairs in an Array
- LeetCode : K-diff Pairs in an Array
- leetCode-K-diff Pairs in an Array
- 【Leetcode】532. K-diff Pairs in an Array
- 532. K-diff Pairs in an Array ------Leetcode
- 【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-algorithms 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
- hdu 1003 Max num (动态规划)
- 关于数据库主键ID是否自增
- 软件工程之用例描述
- 原声js 图片上传并预览
- Android常用布局-01
- [LeetCode]532. K-diff Pairs in an Array
- 关于在eclipse中创建servlet不能自动添加web.xml文件的解决办法
- C语言 JSON 的创建和解析
- 停止线程的多种方法
- Two-Stream Convolutional Networks for Action Recognition in Videos
- qt中connect函数探究
- 【Java8源码分析】并发包-ConcurrentHashMap(二)
- Bootstrap手风琴菜单
- 自制HTML页面