We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0e5ffe5 commit e890414Copy full SHA for e890414
1 file changed
contains-duplicate/doh6077.py
@@ -1,10 +1,8 @@
1
+# https://leetcode.com/problems/contains-duplicate/description/
2
-# set에 저장하면서 중복 여부 확인하기
3
class Solution:
4
- def containsDuplicate(self, nums: list[int]) -> bool:
5
- hashset = set()
6
- for i in nums:
7
- if i in hashset:
8
- return True
9
- hashset.add(i)
10
- return False
+ def containsDuplicate(self, nums: List[int]) -> bool:
+ # Create a set to store unique numbers from nums
+ nums_set = set(nums)
+ return len(nums_set) != len(nums)
+
0 commit comments