Easiest way using Java
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int findPairs(int[] nums, int k) {\n        Arrays.sort(nums);\n        int count=0;\n        for(int i=0;i<nums.length;i++){\n            if(i==0 || nums[i]!=nums[i-1]){\n                for(int j=i+1;j<nums.length;j++){\n                    if(Math.abs(nums[i]-nums[j])==k){\n                        count++;\n                        break;\n                     \n                    }\n                }\n            }\n        }\n        return count;\n    }\n}\n```
['Java']