class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
hashmap = {}
for num in nums:
if num in hashmap:
return True
else:
hashmap[num] = 1
return False
# return len(set(nums)) != len(nums)
数据结构【哈希表】| leetcode 217. 存在重复元素(简单)
最新推荐文章于 2024-10-16 10:13:45 发布