zoukankan      html  css  js  c++  java
  • 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].

    Solution: If k < 0, we can only get 0 because it is not an absolute difference. If k == 0, we need to find all pairs of the same value, so we need to record how many times an element occurs. 

     1 public class Solution {
     2     public int findPairs(int[] nums, int k) {
     3         if (k < 0) return 0;
     4         
     5         HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
     6         for (int num : nums) {
     7             if (map.containsKey(num))
     8                 map.put(num, map.get(num) + 1);
     9             else
    10                 map.put(num, 1);
    11         }
    12         
    13         int result = 0;
    14         for (int num : nums) {
    15             if (map.containsKey(num)) {
    16                 if (k == 0) {
    17                     if (map.get(num) > 1) result++;
    18                 } else {
    19                     if (map.containsKey(num - k)) result++;
    20                     if (map.containsKey(num + k)) result++;
    21                 }
    22             
    23                 map.remove(num);
    24             }
    25         }
    26         
    27         return result;
    28     }
    29 }
  • 相关阅读:
    使用CablleStatement调用存储过程
    权限问题
    全文检索lucene6.1的检索方式
    spring的JdbcTemplate
    spring使用注解开发
    IDEA的快捷键:
    IDEA里面的facets和artifacts的讲解
    Hibernate---criteria的具体使用列子
    关于操作日期函数及其取范围
    hibernate---crateria
  • 原文地址:https://www.cnblogs.com/amazingzoe/p/6597799.html
Copyright © 2011-2022 走看看