442. Find All Duplicates in an Array Difficulty : 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]

算法分析：题目要求是不用额外的空间和O(n)的时间复杂度。因此采用在给定的数组上进行操作的策略，由1 ≤ a[i] ≤ n，主要思路就是把a[i]的值放到a[a[i]-1]的位置，如果发现a[a[i]-1]的值被占用，则表示出现了重复的数字，以下给出两个思路。

C语言版

/**
 * Return an array of size *returnSize.
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* findDuplicates(int* nums, int numsSize, int* returnSize) {
    int i = 0, count = 0;
    int *ret = (int *)malloc(sizeof(int) * numsSize);
    while(i < numsSize)
    {
        if(nums[i] != nums[nums[i] - 1]) //交换两个数
        {
            int temp = nums[i];
            nums[i] = nums[nums[i] - 1];
            nums[temp - 1] = temp;
        }
        else
            i++;
    }
    for(i = 0; i < numsSize; i++)
    {
        if(nums[i] != i + 1) //出现重复的数字
        {
            ret[count] = nums[i];
            count++;
        }
    }
    *returnSize = count;
    return ret;
}

Python版

class Solution(object):
    def findDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        ret = []
        for x in nums:
            if nums[abs(x)-1] < 0: #出现重复数字
                ret.append(abs(x))
            else:
                nums[abs(x)-1] *= -1 #把数字归位
        return ret