Package g1501_1600.s1512_number_of_good_pairs

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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 &lt;= nums.length &lt;= 100

    • 1 &lt;= nums[i] &lt;= 100

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer numIdenticalPairs(IntArray nums)

      • Methods inherited from class java.lang.Object

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