728x90
https://leetcode.com/problems/find-all-duplicates-in-an-array
class Solution:
def findDuplicates(self, nums: List[int]) -> List[int]:
result = []
nums_set = set()
for n in nums:
if n in nums_set:
result.append(n)
else:
nums_set.add(n)
return result
728x90
'IT > 코딩테스트' 카테고리의 다른 글
[Leetcode] 2962. Count Subarrays Where Max Element Appears at Least K Times (0) | 2024.03.29 |
---|---|
[Leetcode] 41. First Missing Positive (1) | 2024.03.26 |
[Leetcode] 287. Find the Duplicate Number (0) | 2024.03.24 |
[Leetcode] 143. Reorder List (0) | 2024.03.23 |
[Leetcode] 234. Palindrome Linked List (0) | 2024.03.22 |