K-diff Pairs in an Array

最新推荐文章于 2021-02-28 12:25:15 发布

673556617-real

最新推荐文章于 2021-02-28 12:25:15 发布

阅读量260

点赞数

分类专栏：算法 leetcode

本文链接：https://blog.csdn.net/awawfwfw/article/details/77692826

版权

算法同时被 2 个专栏收录

243 篇文章 0 订阅

订阅专栏

leetcode

225 篇文章 0 订阅

订阅专栏

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:

The pairs (i, j) and (j, i) count as the same pair.
The length of the array won't exceed 10,000.
All the integers in the given input belong to the range: [-1e7, 1e7].

有个地方有坑，k是差的绝对值，所以不能小于0。另外因为算的是绝对值，正常算的话会出现重复的对。简单点来做的方法是key --> hashmap.contains( k - key)。这样可以保证一个对只计算一次。

代码：

    public int findPairs(int[] nums, int k) {
        
        //dont know why
        if(nums == null || nums.length == 0 || k<0) return 0;
        HashMap<Integer, Integer> map = new HashMap<>();
        int count = 0;
        for(int item: nums){
            if(map.containsKey(item)) {
                map.put(item, map.get(item) + 1);
            }else map.put(item, 1);
        }
        for(Map.Entry<Integer, Integer> entry: map.entrySet()) {
            if( k == 0 ) {
                if(entry.getValue()>1) count++;
            }else {
                if(map.containsKey( entry.getKey() + k)) count++;
            }
        }
        return count;
    }