[C语言][LeetCode][448]Find All Numbers Disappeared in an Array

题目

Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements of [1, n] inclusive that do not appear in this array.

Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.

Example:

Input:
[4,3,2,7,8,2,3,1]

Output:
[5,6]

标签

Array

难度

简单

分析

题目意思是给定整形数组，数组范围是1 <= a[i] <= n，n为数组的大小，其中有些元素出现一次或者两次，找出数组中丢失的元素。
实现思路是遍历数组，出现的数字，将对应数组的位置上的数字置为负数，比如，nums[0] = 4，则将nums[4-1]上的7置为-7，以此类推。然后再遍历一次数组，如果遇到有nums[i]大于0的，则是丢失的元素。

C代码实现

int* findDisappearedNumbers(int* nums, int numsSize, int* returnSize) 
{
    int * ret = (int *)malloc(sizeof(int));
    int i=0, j=0, index=0;

    for(i=0; i<numsSize; i++)
    {
        index = abs(nums[i]) - 1;
        if(nums[index] > 0)
            nums[index] = -nums[index];
    }

    for(i=0; i<numsSize; i++)
    {
        if(nums[i] > 0)
        {
            ret[j++] = i + 1;
            ret = (int *)realloc(ret, sizeof(int));
        }
    }

    *returnSize = j;

    return ret;
}