Package 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.<p>Easy</p> <p>Given an array of integers <code>nums</code>, return <em>the number of <strong>good pairs</strong></em>.</p> <p>A pair <code>(i, j)</code> is called <em>good</em> if <code>nums[i] == nums[j]</code> and <code>i</code> < <code>j</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,1,1,3]</p> <p><strong>Output:</strong> 4</p> <p><strong>Explanation:</strong> There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,1,1,1]</p> <p><strong>Output:</strong> 6</p> <p><strong>Explanation:</strong> Each pair in the array are <em>good</em>.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1,2,3]</p> <p><strong>Output:</strong> 0</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 100</code></li> <li><code>1 <= nums[i] <= 100</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

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

Methods inherited from class java.lang.Object

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

Constructor Details

Solution

public Solution()

Method Details

numIdenticalPairs

public int numIdenticalPairs(int[] nums)