题解——Leetcode 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]

题目如上，简化后的题意如下：

给你一个整数数组，元素大小介于1和数组大小n之间，有些元素会出现两次而其他元素只出现一次。如何在O(n)的时间复杂度以及不占用额外内存的条件下找出所有出现两次的元素。

C