g1501_1600.s1512_number_of_good_pairs

Class Solution

java.lang.Object

g1501_1600.s1512_number_of_good_pairs.Solution

public class Solution
extends Object

1512 - Number of Good Pairs.

Easy

Given an array of integers nums, return the number of good pairs.

A pair (i, j) is called good if nums[i] == nums[j] and i < j.

Example 1:

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:

Input: nums = [1,1,1,1]

Output: 6

Explanation: Each pair in the array are good.

Example 3:

Input: nums = [1,2,3]

Output: 0

Constraints:

• 1 <= nums.length <= 100
• 1 <= nums[i] <= 100

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
int	numIdenticalPairs(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

numIdenticalPairs

public int numIdenticalPairs(int[] nums)