zoukankan      html  css  js  c++  java
  • leetCode-K-diff Pairs in an Array

    Description:
    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].

    Solution:

    public class Solution {
        public int findPairs(int[] nums, int k) {
            if (nums == null || nums.length == 0 || k < 0)   return 0;
    
            Map<Integer, Integer> map = new HashMap<>();
            int count = 0;
            for (int i : nums) {
                map.put(i, map.getOrDefault(i, 0) + 1);
            }
    
            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
                if (k == 0) {
                    //count how many elements in the array that appear more than twice.
                    if (entry.getValue() >= 2) {
                        count++;
                    } 
                } else {
                    if (map.containsKey(entry.getKey() + k)) {
                        count++;
                    }
                }
            }
    
            return count;
        }
    }

    Better Solution:

    class Solution {
        public int findPairs(int[] nums, int k) {
            if(nums == null || nums.length < 2 || k < 0) return 0;
            Arrays.sort(nums);
            int left=0, right=0;
            int count = 0;
            while(left < nums.length && right < nums.length){
                int val = nums[left] + k;
                if(nums[right] == val && left != right){
                    count++;
                    left++;
                    right++;
                    while(left < nums.length && nums[left-1] == nums[left]) left++;
                }else if(val > nums[right]) right++;
                else left++;
            }
            return count;
        }
    }
  • 相关阅读:
    poj-1001 求高精度幂
    ECS训练营Day1—基于阿里云ECS、VuePress搭建静态网站
    阿里云免费领马克杯答案
    白盒测试之逻辑覆盖 简单易懂~
    如何合并多个PPT?
    failed to connect to gitee.com/github/gitlab port 443: timed out之类的错误
    解决 These dependencies were not found: * core-js/modules/es6.array.fill in xxx 之类的问题
    vue内嵌iframe跨域通信
    Luffy之课程详情页
    Flask之SQLAlchemy,flask_session以及蓝图
  • 原文地址:https://www.cnblogs.com/kevincong/p/7900392.html
Copyright © 2011-2022 走看看