217. Contains Duplicate
Easy
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
😇 Solution
class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
return not (len(set(nums)) == len(nums)) #set() - O(n)class Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
l = len(nums)
nums.sort() #O(nlogn)
for i in range(l-1):
if nums[i] == nums[i+1]:
return True
return Falseclass Solution:
def containsDuplicate(self, nums: List[int]) -> bool:
l=len(nums)
for i in range(l): #O(n)
for j in range(i+1,l): #O(n)
if nums[i] == nums[j]:
return True
return FalseLast updated
Was this helpful?