LeetCode – 532. K-diff Pairs in an Array

Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both numbers in the array and their absolute difference is k.

Example 1:

Input: [3, 1, 4, 1, 5], k = 2
Output: 2
Explanation: There are two 2-diff pairs in the array, (1, 3) and (3, 5).
Although we have two 1s in the input, we should only return the number of unique pairs.

Example 2:

Input:[1, 2, 3, 4, 5], k = 1
Output: 4
Explanation: There are four 1-diff pairs in the array, (1, 2), (2, 3), (3, 4) and (4, 5).

Example 3:

Input: [1, 3, 1, 5, 4], k = 0
Output: 1
Explanation: There is one 0-diff pair in the array, (1, 1).

Note:

  1. The pairs (i, j) and (j, i) count as the same pair.
  2. The length of the array won’t exceed 10,000.
  3. All the integers in the given input belong to the range: [-1e7, 1e7].
public class Solution {
        public int findPairs(int[] nums, int k) {
            if(k<0) return 0;
            int i=0;
            int j =1;
            int count = 0;
            HashMap<Integer,Integer> map = new HashMap();
            while(i<nums.length && j<nums.length){
                if(nums[i]-nums[j] == k){
                    if(map.containsKey(nums[i]) && map.get(nums[i]) !=nums[j]){
                        count++;
                    }
                    else if(!map.containsKey(nums[i])){
                        count ++;
                    }
                    map.put(nums[i],nums[j]);
                }
                else if(nums[j]-nums[i] == k){
                    if(map.containsKey(nums[j]) && map.get(nums[j]) !=nums[i]){
                        count++;
                    }
                    else if(!map.containsKey(nums[j])){
                        count++;
                    }
                    map.put(nums[j],nums[i]);
                }
                j++;
                if(j == nums.length){
                    i++;
                    j=i+1;
                }                
            }

            return count;
        }
}

喜欢的话订阅一个呗~第一时间收到文章更新哟~

发表评论

电子邮件地址不会被公开。