LeetCode --- 1512. Number of Good Pairs 解题报告

Posted 杨鑫newlfe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1512. 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: 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
# 

以上是关于LeetCode --- 1512. Number of Good Pairs 解题报告的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode --- 1512. Number of Good Pairs 解题报告

1512. Number of Good Pairs

LeetCode136 Single Number, LeetCode137 Single Number II, LeetCode260 Single Number III

LeetCode Strobogrammatic Number

LeetCode Strobogrammatic Number II

LeetCode Super Ugly Number