方法1:
#判断原数组和该数组的长度相不相等,一行解决
class Solution:
def containsDuplicate(self, nums):
return len(set(nums))!=len(nums)
nums=[1,1,1,3,3,4,3,2,4,2]
t=Solution()
t.containsDuplicate(nums)
方法2:
class Solution:
def containsDuplicate(self, nums):
dic={}
for i in nums:
if dic.get(i): #查找是否有键i
return True
else:
dic[i]=1
return False
nums=[1,2,3,1]
t=Solution()
t.containsDuplicate(nums)
方法3:
#排序之后,相等元素必相邻:
class Solution:
def containsDuplicate(self, nums):
nums.sort()
print(nums)
for i in range(len(nums)-1):
if nums[i]==nums[i+1]:
return True
return False
nums=[1,2,3,1]
t=Solution()
t.containsDuplicate(nums)