Number of Good Pairs
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
4There are 4 good pairs: (0, 3), (0, 4), (3, 4), and (2, 5), using 0-indexed positions.
Example 2
Input
nums = [1,1,1,1]Output
6Each pair in the array is good.
Constraints
- 1 <= nums.length <= 100
- 1 <= nums[i] <= 100