Lecode day 6 448哈希表待优化

猪猪虾的业余生活

于 2023-02-23 21:32:58 发布

阅读量135

点赞数

分类专栏： C语言数据结构文章标签：散列表算法 c++

本文链接：https://blog.csdn.net/weixin_43528481/article/details/129190423

版权

C语言数据结构专栏收录该内容

9 篇文章 1 订阅

订阅专栏

在这里插入图片描述

超出时间限制

int* findDisappearedNumbers(int* nums, int numsSize, int* returnSize) 
{
	int* temp;
	temp = (int*)malloc(numsSize * sizeof(int));
	int counter = 0;
	for (int i = 1; i <= numsSize; i++)
	{
		int apper_label = 0;
		for (int j = 0; j < numsSize; j++)
		{
			if (i == nums[j])
			{
				apper_label = 1;
				break;
			}
		}
		if (apper_label == 0)
		{
			
			temp[counter] = i;
			counter += 1;
		}
	}

	int* array;
	array = (int*)malloc(counter * sizeof(int));
	for (int i = 0; i < counter; i++)
	{
		array[i] = temp[i];
	}

	free(temp);

	*returnSize = counter;
	return array;
}

int main()
{
	int returnSize = 0;
	int nums[] = { 1,1 };
	int numsSize = sizeof(nums) / 4;
	int* FindArray;
	FindArray = findDisappearedNumbers(nums, numsSize, &returnSize);
	for (int i = 0; i < returnSize; i++)
	{
		printf("i =  %d ", FindArray[i]);
	}
	
	return 0;
}