贪吃蛇避免食物与身体重合的算法哪里错了,求助!!!
void foodset(struct Food* food,struct Snake* snake)
{
int i, boolfood=1;
srand((unsigned )time(NULL));
food->x=rand()%201;
food->y=rand()%201;
while(1)
{
boolfood=1;
while(food->x%15!=0)(food->x)++; //必须被15整除才可,否则蛇吃不到
while(food->y%15!=0)(food->y)++;
for( i=0;i<snake->node;++i) //食物不能与蛇身重合
if(food->x==snake->x[i] && food->y==snake->y[i]) //此算法有问题,当重合时会出现死机!!!!!
{
boolfood=0;
break;
}
if(boolfood)
{
break;
}
}
}
请问哪有问题,我用api写的,为什么重合就会死机有没有跟好的解决算法