【发布时间】:2017-01-23 04:37:53
【问题描述】:
我在第二个函数中的 realloc 语句一直工作到一个点,然后指针似乎突然指向随机内存。有人可以解释我如何解决这个问题吗?看看输出可能会节省一些时间。 谢谢。
int main()
{
int testCases, i, n;
int* primeArray;
int* size;
primeArray = malloc(sizeof(int));
primeArray[0] = 2;
size = 1;
int number = 2;
while(number < 1000){
number = nextPrime(number, primeArray, &size);
printf("Prime Array at %d is %d, size is %d, number is %d \n", 0, primeArray[0], size, number);
}
scanf("%d", &testCases);
for(i = 0; i < testCases; i++){
scanf("%d", n);
}
free(primeArray);
free(size);
return 0;
}
第二个功能:
int nextPrime(int number, int* primeArray, int* size){
int foundPrime = 0, num = number, i;
while(!foundPrime){
num++;
int allNums = 0;
//printf("Size: %d \n", *size);
for(i = 0; i < *size; i++){
//printf("%d mod %d \n", num, primeArray[i]);
if(num % primeArray[i] != 0){
allNums += 0;
}
else {
allNums = 1;
break;
}
}
if(allNums == 0){
*size+=1;
//printf("Size: %d \n", *size);
foundPrime = 1;
primeArray = realloc(primeArray, *size * sizeof(int) );
primeArray[*size-1] = num;
//printf("%d \n", primeArray[*size-1]);
return num;
}
}
}
输出:
Prime Array at 0 is 2, size is 2, number is 3
Prime Array at 0 is 2, size is 3, number is 5
Prime Array at 0 is 2, size is 4, number is 7
...
Prime Array at 0 is 2, size is 94, number is 491
Prime Array at 0 is 2, size is 95, number is 499
Prime Array at 0 is 2, size is 96, number is 503
Prime Array at 0 is 16852008, size is 97, number is 509
【问题讨论】:
-
当然
int* size;... size = 1;生成了编译器警告。再次编译并启用所有警告。 -
离题 - 如果您跳过所有偶数,您在
nextPrime中的循环可能会更快。即在每次迭代中将num递增 2 而不是num++。您也可以在num > sqrt(primeArray[last]时提前终止循环