[Leetcode] 532. K-diff Pairs in an Array 解题报告
来源:互联网 发布:数据库设计原则 范式 编辑:程序博客网 时间:2024/06/03 21:28
题目:
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 = 2Output: 2Explanation: 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 = 1Output: 4Explanation: 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 = 0Output: 1Explanation: 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].
思路:
一道比较直观的Two Pointers问题。需要注意的是k为负数以及k为0的特殊情况。
代码:
class Solution {public: int findPairs(vector<int>& nums, int k) { if (k < 0) { // in case k is nagetive (absolute difference cannot be nagetive) return 0; } sort(nums.begin(), nums.end()); int start = 0, end = 1; set<pair<int, int>> pairs; while (end < nums.size()) { int diff = nums[end] - nums[start]; if (diff == k) { if (start != end) { // in case k is zero pairs.insert(make_pair(nums[start], nums[end])); ++start, ++end; } else { ++end; } } else if (diff < k) { ++end; } else { ++start; } } return pairs.size(); }};
阅读全文
0 0
- [Leetcode] 532. K-diff Pairs in an Array 解题报告
- 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 Java版
- 【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
- 博主终于自己建站,欢迎大家访问
- Spring拦截器
- 数据库——事务隔离级别
- 2017.12.18学习日志
- Bootstrap3的简单入门
- [Leetcode] 532. K-diff Pairs in an Array 解题报告
- 23种设计模式汇总
- (翻译)便捷跳转( Shortcut Dropdown)
- 如何根据概率密度函数生成随机分布
- mac搭建nginx+php7开发环境
- 野指针
- tensorflow | 维度转换
- Pacemaker+corosync
- .Net利用Newtonsoft进行解析Json的快捷方法