{
if((p->gcNc[0].cellNc[i].frequences[k]-freq >= Cii
------解决方案--------------------
p->gcNc[0].cellNc[i].frequences[k]-freq <= -Cii ))
{
a[freq] = 1;
p->gcNc[0].cellNc[i].frequences[j] = freq;
printf("%d ",p->gcNc[0].cellNc[i].frequences[j]);
}else{
judge = 1;
break;
//goto loop; ///?????????????????????????????????
printf("continue");
}
}
}
if(1 == judge)
{
judge = 0;
coutinue;
}
}
}
以下是我写的一个简单的goto,貌似和楼主的用法没什么区别
#include
#include
int main()
{
int i = 0;
int j = 0;
int m = 0;
int n = 0;
for(i = 0; i
{
printf("i = %d\n", i);
loop:for(j = 0; j
{
n++;
if(4 == n)
break;
printf("j = %d\n", j);
if(9 == j)
continue;
for(m = 0; m
printf("m = %d\n", m);
if(7 == m)
goto loop;
}
}
}
return 0;
}
------解决方案--------------------
bool xxxx; //这里是加的
for(int i=0;i
{
xxxx=false; //这里是加的
for(int j=0;jgcNc[0].cellNc[i].NombreFrequences;j++)
{
if(xxxx) break; //这里是加的
int freq = rand() % m +1;
//exist
------解决方案--------------------
non satisfait Cii contrainte(CSC). exemple rand() 7,encore rand() 7
if(a[freq] == 1)
{
j--;
continue;
}
//non exist && satisfait contrainte. exemple: rand() 7, apres rand() 8
if(a[freq] != 1)
{
for(int k=0;kgcNc[0].cellNc[i].NombreFrequences;k++)