532. K-diff Pairs in an Array*

532. K-diff Pairs in an Array*

https://leetcode.com/problems/k-diff-pairs-in-an-array/

题目描述

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 = 2
Output: 2
Explanation: 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 = 1
Output: 4
Explanation: 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 = 0
Output: 1
Explanation: 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]

C++ 实现 1

用排序的方法做, 用二分法做数据搜索.

这里要注意题目🐔贼的地方: 其实际要求的是数组中是否存在 j > i && j = i + k 而不是 j > i && j = i + std::abs(k).

下面代码给出了 lower_bound 以及 upper_bound(没有用到, 但顺手实现了) 的实现. 解题思路是对数据排序, 然后对每个数 nums[i], 使用 lower_bound 查找 [i + 1, N - 1] 范围内是否存在 target = nums[i] + k. 另外, 如果 num[i + 1] == nums[i], 还需要过滤, 因为题中要求 unique 的结果.

class Solution {
private:
    int lower_bound(const vector<int> &nums, int i, int j, int target) {
        if (i > j) return -1;
        while (i <= j) {
            int mid = i + (j - i) / 2;
            if (nums[mid] < target) i = mid + 1;
            else j = mid - 1;
        }
        return i >= nums.size() ? -1 : i;
    }
    int upper_bound(const vector<int> &nums, int i, int j, int target) {
        if (i > j) return -1;
        while (i <= j) {
            int mid = i + (j - i) / 2;
            if (nums[mid] <= target) i = mid + 1;
            else j = mid - 1;
        }
        return i >= nums.size() ? -1 : i;
    }
public:
    int findPairs(vector<int>& nums, int k) {
        std::sort(nums.begin(), nums.end());
        int i = 0, res = 0;
        while (i < nums.size()) {
            int target = nums[i] + k;
            int l = lower_bound(nums, i + 1, nums.size() - 1, target);
            if (l != -1 && nums[l] == target) res ++;
            while (i + 1 < nums.size() && nums[i + 1] == nums[i]) ++ i;
            ++ i;
        }
        return res;
    }
};

C++ 实现 2

本题还可以使用哈希表做, 思路很简单. 主要注意 k == 0 的情况.

class Solution {
public:
    int findPairs(vector<int>& nums, int k) {
        unordered_map<int, int> record;
        for (auto &d : nums) {
            auto iter = record.find(d);
            if (iter != record.end())
                iter->second ++;
            else
                record.insert(make_pair(d, 1));
        }
        int count = 0;
        if (k == 0) {
            for (auto &elem : record) {
                if (elem.second > 1)
                    count ++;
            }
        }
        else if (k > 0) {
            for (auto &elem : record) {
                auto iter = record.find(elem.first + k);
                if (iter != record.end()) {
                    count ++;
                }
            }
        }
        return count;
    }
};