[LeetCode] 532. K-diff Pairs in an Array
来源:互联网 发布:悔女知之乎的意思 编辑:程序博客网 时间:2024/06/09 14: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 Pointersclass Solution {public: int findPairs(vector<int>& nums, int k) { const int n = nums.size(); sort(nums.begin(), nums.end()); int nPairs = 0, i = 0, j = 1; while (j < n) { int diff = nums[j] - nums[i]; if (diff < k) { j++; } else if (diff > k) { i++; j += (i == j); } else { nPairs++; for (int tmp = nums[j]; nums[j] == tmp; j++); for (int tmp = nums[i]; nums[i] == tmp; i++); j += (i == j); } } return nPairs; }};
阅读全文
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
- jvm调优转载自http://www.cnblogs.com/xingzc/p/5756119.html
- tensorflow部署
- spring boot开发注意事项
- 字符串读入问题 (C语言)
- linux下磁盘占用达到100%了,找不到哪些大文件耗尽了磁盘。
- [LeetCode] 532. K-diff Pairs in an Array
- HDU2033
- java.lang.IllegalStateException: getOutputStream() has already been called for this response
- 51nod--1049 最大字段和
- 微信支付文档
- Android ConstraintLayout
- linux kernel的中断子系统之(四):High level irq event handler
- Bound Found POJ
- crond与crontab