题目描述
思路
暴力模拟
可以使用两层循环,一层遍历i,一层遍历j,对每个(i, j)的组合判断差的绝对值是否为k,统计所有符合条件的数对。
Python实现
class Solution:
def countKDifference(self, nums: List[int], k: int) -> int:
res, n = 0, len(nums)
for i in range(n):
for j in range(i+1, n):
if abs(nums[i] - nums[j]) == k:
res += 1
return res
Java实现
class Solution {
public int countKDifference(int[] nums, int k) {
int res = 0, n = nums.length;
for (int i = 0; i < n; ++i) {
for (int j = i+1; j < n; ++j) {
if (Math.abs(nums[i] - nums[j]) == k) {
++res;
}
}
}
return res;
}
}