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

    这题目好坑,k 可以是负数。。。。。

    class Solution {
    public:
        int findPairs(vector<int>& nums, int k) {
            map<int, int> mp;
            int n = nums.size();
            for (int i = 0; i < n; ++i) {
                mp[nums[i]]++;
            }
            int ans = 0;
            if (k < 0) return 0;
            for (auto it : mp) {
                int x = it.first;
                int y = mp.find(x + k)->second;
                if (k == 0) {
                    if (y >= 2) {
                        ans++;
                        mp[x + k] -= 2;
                    }
                } else if (y > 0){
                    ans ++;
                    mp[x + k] --;
                    mp[x]--;
                }
            }
            return ans;
        }
    };
  • 相关阅读:
    POJ 1321 棋盘问题
    算法导论 4.1 最大子数组问题
    矩阵快速幂
    固定定位
    HTML排版
    CSS笔记2
    HDU 1796 How many integers can you find(容斥原理)
    HDU 2147 kiki's game(博弈经典题)
    HDU 1846 Brave Game(巴什博弈超简单题)
    HDU 4704 Sum(隔板原理+组合数求和公式+费马小定理+快速幂)
  • 原文地址:https://www.cnblogs.com/pk28/p/7256079.html
Copyright © 2011-2022 走看看