[leetcode] 1512. Number of Good Pairs

Description

Given an array of integers nums.

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

Return the number of good pairs.

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

分析

题目的意思是：给你一个数组，求出相同数的对数，这是一道easy类型的题目，用双重循环暴力破解也能够ac，后面发现用hashtable可以更好的解决，所以实现了一下，只需要两次遍历就行了，看来平时还是需要严格要求自己哈哈哈哈。

代码

class Solution:
    def numIdenticalPairs(self, nums: List[int]) -> int:
        cnt=0
        counter=collections.Counter(nums)
        for k,v in counter.most_common():
            cnt+=v*(v-1)//2
        return cnt