217. Contains Duplicate
方法1:set最慢速度
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
return len(nums) != len(set(nums))
方法2: set, 更慢速度
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
s = set()
for num in nums:
if num not in s:
s.add(num)
else:
return True
return False
219. Contains Duplicate II: set
class Solution:
def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
if len(set(nums)) == len(nums):
return False
for i in range(len(nums)):
if len(set(nums[i : i+k+1])) < len(nums[i : i+k+1]):
return True
return False