leetcode算法题--差的绝对值为 K 的数对数目

原题链接：https://leetcode-cn.com/problems/count-number-of-pairs-with-absolute-difference-k/

1、方法一
穷举

class Solution {
public:
    int countKDifference(vector<int>& nums, int k) {
        int n = nums.size();
        int res = 0;
        for (int i = 0; i < n; ++i) {
            for (int j = i + 1; j < n; ++j) {
                if (abs(nums[i] - nums[j]) == k ) {
                    res++;    
                }
            }
        }
        return res;
    }
};

2、 方法二
hash表

class Solution {
public:
    int countKDifference(vector<int>& nums, int k) {
        int res = 0;
        unordered_map<int, int> mp;
        for (auto &x : nums) {
            res += mp.count(x + k) ? mp[x + k] : 0;
            res += mp.count(x - k) ? mp[x - k] : 0;
            mp[x]++;
        }
        return res;
    }
};