leetcode/problems/find-all-duplicates-in-an-array at v1.6.5 · awesee/leetcode

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
find_all_duplicates_in_an_array.go		find_all_duplicates_in_an_array.go
find_all_duplicates_in_an_array_test.go		find_all_duplicates_in_an_array_test.go

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

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]