日期:2014-05-20 浏览次数:20863 次
int i=0;
int j=0;
for(int i = 0; i < 2000;i++)
{
if(j == 0)
{
b[i][0] = a[n][3];
b[i][2] = a[n][6];
///////////////////////////////////
b[i][4] = a[n+1][3];
b[i][6] = a[n+1][6];
}
if(j == 1)
{
b[i][0] = a[n][11];
b[i][1] = a[n][7];
b[i][2] = a[n][12];
/////////////////////////////
b[i][4] = a[n+1][11];
b[i][5] = a[n+1][7];
b[i][6] = a[n+1][12];
}
if(j == 2)
{
b[i][0] = a[n][14];
b[i][2] = a[n][15];
//////////////////////////////////
b[i][4] = a[n+1][14];
b[i][6] = a[n+1][15];
}
if(j == 3)
{
j=-1;
n += 2;
}
j++;
}
int i=0;
int j=0;
int k=0;
for(int i = 0; i < 2000;i++)
{
if(j == 0)
{
b[i][0] = a[n][3];
b[i][2] = a[n][6];
///////////////////////////////////
b[i][4] = a[n+1][3];
b[i][6] = a[n+1][6];
}
if(j == 1)
{
b[i][0] = a[n][11];
b[i][1] = a[n][7];
b[i][2] = a[n][12];
/////////////////////////////
b[i][4] = a[n+1][11];
b[i][5] = a[n+1][7];
b[i][6] = a[n+1][12];
}
if(j == 2)
{
b[i][0] = a[n][14];
b[i][2] = a[n][15];
//////////////////////////////////
b[i][4] = a[n+1][14];
b[i][6] = a[n+1][15];
}
if(j == 3)
{
j=-1;
k++;
if (k == 2) {
k = 0;
b[i][?] = a[n+2][?]; //设置第6行内容
...
n += 1; //第7行如果就此跳过就执行这个,否则不执行
}
n += 2;
}
j++;
}