Open carloscn opened 1 year ago
pub fn count_k_difference(nums: Vec<i32>, k: i32) -> i32
{
if nums.len() < 1 {
return 0;
}
let mut ret:i32 = 0;
for i in 0..nums.len() {
for j in i..nums.len() {
if i32::abs(nums[i] - nums[j]) == k as i32 {
ret += 1;
}
}
}
return ret;
}
Description
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 = 1 Output: 4 Explanation: The pairs with an absolute difference of 1 are:
Example 2:
Input: nums = [1,3], k = 3 Output: 0 Explanation: There are no pairs with an absolute difference of 3.
Example 3:
Input: nums = [3,2,1,5,4], k = 2 Output: 3 Explanation: The pairs with an absolute difference of 2 are:
Constraints:
1 <= nums.length <= 200 1 <= nums[i] <= 100 1 <= k <= 99