1
我写了一个应该使用递归来增长'雪花'的方法,它本质上是一棵树。出于某种原因,在调试时,它只向树添加一行,不会超过这一行。我认为它与指针有关,但似乎无法弄清楚它有什么问题。帮助将非常感激。用指针递归-C
int growth(Snowflake * root, Snowflake * parent, Ray * ray){
printf("*\n");
printf("%f\n", root->ray->starting_point);
printf("%f\n", ray->angle);
if (root->middle != NULL){
printf("Found middle! \n");
growth(root->middle, root, ray);
}
else if (root->right != NULL){
printf("Found off center!\n");
growth(root->right, root, ray);
printf("Found off middle!\n");
growth(root->left, root, ray);
}
else{
if (parent == NULL){
printf("MY PARENTS ARE DEAD!\n");
parent = root;
//root = &parent;
}
printf("Starting Again!\n");
Snowflake * add = malloc(sizeof(Snowflake));
add->parent = parent;
add->middle = NULL;
add->right = NULL;
add->left = NULL;
add->ray = ray;
add->ray->starting_point = add->parent->ray->end_point;
add->ray->end_point = add->ray->starting_point + 1;
printf("%f\n",add->ray->starting_point);
printf("%f\n",add->ray->end_point);
if (add->ray->angle == 0){
add->parent->middle = add;
}
else{
add->parent->right = add;
add->parent->left = add;
}
return 1;
}
}
您是否尝试过使用调试器? – dutt
请缩进你的代码,并提供'Snowflake'和'Ray'类型的定义。 – ajay
@达特,你有没有试过看OP的前两句话? – CiaPan