No532.java

packageAlgorithm.leetcode.Array;

importjava.util.HashSet;
importjava.util.Set;

/**
 * 
 * Created by tujietg on Nov 14, 2019
 */
publicclassNo532 {
publicintfindPairs(int[] nums, intk) {
Set<Integer> hashSet = newHashSet<Integer>();
for (inti = 0; i < nums.length; i++) {
for (intj = i + 1; j < nums.length; j++) {
if (Math.abs(nums[i] - nums[j]) == k) {
if (nums[i] > nums[j]) {
hashSet.add(nums[j]);
 } else {
hashSet.add(nums[i]);
 }
 }
 }
 }
returnhashSet.size();
 }

publicstaticintfindPairs02(int[] nums, intk) {
if (k < 0)
return0;
Set<Integer> numbers = newHashSet<>();
Set<Integer> found = newHashSet<>();
for (intn : nums) {
if (numbers.contains(n + k))
found.add(n);
if (numbers.contains(n - k))
found.add(n);
numbers.add(n - k);
 }
returnfound.size();
 }

}