1512. 好数对的数目
原始解法
class Solution:
def numIdenticalPairs(self, nums: List[int]) -> int:
n = len(nums)
r = 0
for i in range(n):
for j in range(i+1,n):
if nums[i] == nums[j]:
r += 1
return r
同样原始
class Solution:
def numIdenticalPairs(self, nums: List[int]) -> int:
map = {}
list = []
for i in nums:
if i in map:
map[i] += 1
else:
map[i] = 1
list.append(i)
n = 0
for i in list:
n += (map[i]-1)*map[i]/2
return int(n)