leetcode
This commit is contained in:
11
leetcode/217.py
Normal file
11
leetcode/217.py
Normal file
@@ -0,0 +1,11 @@
|
||||
class Solution:
|
||||
def containsDuplicate(self, nums: List[int]) -> bool:
|
||||
l=set()
|
||||
isDu=False
|
||||
for i in nums:
|
||||
if i in l:
|
||||
isDu=True
|
||||
break
|
||||
else:
|
||||
l.add(i)
|
||||
return isDu
|
||||
Reference in New Issue
Block a user