public int countKDifference(int[] nums, int k) {
int cnt=0;
for (int i = 0; i < nums.length; i++) {
for (int j = i+1; j < nums.length; j++) {
if(Math.abs(nums[i]-nums[j])==k)
cnt++;
}
}
return cnt;
}
2022.2.9-----leetcode.2006
最新推荐文章于 2024-07-25 19:34:38 发布