zoukankan      html  css  js  c++  java
  • #Leetcode# 532. K-diff Pairs in an Array

    https://leetcode.com/problems/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 jare 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].

    代码1:

    class Solution {
    public:
        int findPairs(vector<int>& nums, int k) {
            int n = nums.size();
            sort(nums.begin(), nums.end());
            set<pair<int, int> > s;
            
            for(int i = 0; i < n - 1; i ++) {
                for(int j = i + 1; j < n; j ++) {
                    if(nums[j] - nums[i] == k) 
                        s.insert({nums[i], nums[j]});
                    else if(nums[j] - nums[i] > k) break;
                    else continue;
                }
            }
            
            return (int)s.size();
        }
    };
    View Code

    代码2:

    class Solution {
    public:
        int findPairs(vector<int>& nums, int k) {
            int n = nums.size();
            unordered_map<int, int> mp;
            for(int i = 0; i < n; i ++)
                mp[nums[i]] ++;
            
            int ans = 0;
            for(auto i : mp) {
                if(k == 0 && i.second > 1) ans ++;
                else if(k > 0 && mp.count(i.first + k)) ans ++;
            }
            return ans;
        }
    };
    View Code

     

  • 相关阅读:
    DB设计原则
    英文地址[转]
    ICollection
    雅虎优化14条
    vue过滤器
    php中echo(),print(),print_r()之间的区别
    jQ中对attr()方法的理解
    浅析call和apply的不同
    浅析call和apply
    PHP是弱类型语言,自动转换,强制转换
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10406472.html
Copyright © 2011-2022 走看看