Given an integer array?nums?and an integer?k, return?the number of pairs?(i, j)?where?i < j?such that?|nums[i] - nums[j]| == k.

The value of?|x|?is defined as:

• x?if?x >= 0.

• -x?if?x < 0.

?

Example 1:

Input: nums = [1,2,2,1], k = 1Output: 4Explanation: The pairs with an absolute difference of 1 are: - [1,2,2,1] - [1,2,2,1] - [1,2,2,1] - [1,2,2,1]

Example 2:

Input: nums = [1,3], k = 3Output: 0Explanation: There are no pairs with an absolute difference of 3.

Example 3:

Input: nums = [3,2,1,5,4], k = 2Output: 3Explanation: The pairs with an absolute difference of 2 are: - [3,2,1,5,4] - [3,2,1,5,4] - [3,2,1,5,4]

?

Constraints:

• 1 <= nums.length <= 200

• 1 <= nums[i] <= 100

• 1 <= k <= 99

• 本來想是直接map 排序的，但是忘記怎么寫了，所以還是用了優(yōu)先隊列。

Runtime6 ms

Beats

68.2%

Memory42.3 MB

Beats

44.36%

Click to check the distribution chart