442. Find All Duplicates in an Array (Medium)
Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements that appear twice in this array.
Could you do it without extra space and in O(n) runtime?
Example:
Input: [4,3,2,7,8,2,3,1] Output: [2,3]
遍历一遍,time O(n),space:O(n)
其实相当于hash:colletions.counter
class Solution:
def findDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
count = [0]*(len(nums)+1)
for i in nums:
count[i] += 1
dup = []
for i in range(len(count)):
if count[i] >1:dup.append(i)
return dup