每次思考都是一次进步
1、暴力解,枚举任意两数进行求差
class Solution {
public:
int countKDifference(vector<int>& nums, int k) {
int thesize=nums.size();
int count=0;
for(int i=0;i<thesize-1;++i)
for(int j=i+1;j<thesize;++j)
{
if(abs(nums[i]-nums[j])==k)
{
++count;
}
}
return count;
}
};