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 58988dd commit 9877f42Copy full SHA for 9877f42
contains-duplicate/Jay-Mo-99.py
@@ -18,9 +18,6 @@ def containsDuplicate(self, nums):
18
19
#Space Complexity: O(N)
20
#-set은 nums의 길이에 의해 생성되므로 n에 영향받음(The set requires extra space depends on the size of nums) : O(N)
21
- if len(list(set(nums))) == len(nums):
22
- return False
23
- else:
24
- return True
+ return len(list(set(nums))) != len(nums) #set된 list와 기존 nums의 len이 일치하지 않는다면 true(duplicate), 아니면 false
25
26
0 commit comments