leetcode 448

最新推荐文章于 2021-07-13 22:06:06 发布

qq_35785763

最新推荐文章于 2021-07-13 22:06:06 发布

阅读量282

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_35785763/article/details/54571331

版权

leetcode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

/**
* Return an array of size *returnSize.
* Note: The returned array must be malloced, assume caller calls free().
*/
int* findDisappearedNumbers(int* nums, int numsSize, int* returnSize) {
    int* tmp, i,x,dis_num =numsSize,*result;
    tmp = (int *)malloc((numsSize + 1)*sizeof(int));
    for (i = 1;i < numsSize + 1;i++)
        tmp[i] = 0;
    for (i = 0;i < numsSize;i++)
    {
        x = nums[i];
        if (!tmp[x])
        {
            tmp[x] = 1;
            dis_num--;
        }
    }
    *returnSize = dis_num;
    result = (int *)malloc(dis_num*sizeof(int));
    for (i = numsSize;i >0;i--)
    {
        if (!tmp[i])
        {
            result[dis_num-1] = i;
            dis_num--;
        }
    }
    return result;
}