Number Of Good Pairs Problem


Description

LeetCode Problem 1512. Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j.

Return the number of good pairs.

Example 1:

1
2
3
Input: nums = [1,2,3,1,1,3]
Output: 4
Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.

Example 2:

1
2
3
Input: nums = [1,1,1,1]
Output: 6
Explanation: Each pair in the array are good.

Example 3:

1
2
Input: nums = [1,2,3]
Output: 0


Solution

We can scan through the array. During the scanning, we use a hash table to store the number of occurrences of each unique integer. For example, for the array [1, 2, 3, 1, 1, 3], we have: (1, 3), (2, 1), (3, 2). The first number, which is the key of the hash table, shows the integer in the array. The second number shows how many times this integer appears in the array.

Then we can scan through the hash table, and the number of good pairs is (n - 1) * n / 2 (n is the number of occurrences of each integer). Finally, we add up all the number of good pairs and return the result.

The time complexity is O(n), and the space complexity is O(n).


Sample C++ Code

This is a C++ implementation of the above approach.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

int numIdenticalPairs(vector<int>& nums) {
    map<int, int> ht;
    for (int i = 0; i < nums.size(); i ++) {
        if (ht.find(nums[i]) == ht.end())
            ht[nums[i]] = 0;
        ht[nums[i]] ++;
    }
    int cnt = 0;
    for (map<int, int>::iterator mit = ht.begin(); 
        mit != ht.end(); mit ++) {
        int n = mit->second;
        cnt += (n - 1) * n / 2;
    }
    return cnt;
}

int main() {
    vector<int> nums = {1, 2, 3, 1, 1, 3};
    cout << numIdenticalPairs(nums) << endl;
}




Related Posts

X Of A Kind In A Deck Of Cards Problem

LeetCode 914. In a deck of cards, each card has...

Word Subsets Problem

LeetCode 916. You are given two string arrays words1 and...

Unique Morse Code Words Problem

LeetCode 804. International Morse Code defines a standard encoding where...

Unique Email Addresses Problem

LeetCode 929. Every valid email consists of a local name...

Uncommon Words From Two Sentences Problem

LeetCode 884. A sentence is a string of single-space separated...

Triples With Bitwise And Equal To Zero Problem

LeetCode 982. Given an integer array nums, return the number...