class Solution:
def findDuplicate(self, nums: List[int]) -> int:
return int((sum(nums)-sum(set(nums)))/(len(nums)-len(set(nums))))
LeetCode:287.寻找重复数
最新推荐文章于 2022-08-05 16:21:40 发布
class Solution:
def findDuplicate(self, nums: List[int]) -> int:
return int((sum(nums)-sum(set(nums)))/(len(nums)-len(set(nums))))