《C语言入门100例》(第31例) 计数

448. 找到所有数组中消失的数字https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array/

代码：哈希表的简单运用

/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* findDisappearedNumbers(int* nums, int numsSize, int* returnSize){
    int *ans=(int *)malloc(sizeof(int)*numsSize);
    int num[100001];
    memset(num,0,sizeof(num));
    for(int i=0;i<numsSize;i++)
    {
        num[nums[i]]++;
    }

    int k=0;
    for(int i=1;i<=numsSize;i++)
    {
        if(num[i]==0)
        {
            ans[k++]=i;
        }
    }

    *returnSize=k;
    return ans;
}