研究一上午才整明白,主要是那几个循环太折磨人了
给自己做个备忘,以后少循环思路就回来看看这个程序
#include <stdio.h>
#include <stdlib.h>
int main()
{
int A[6][6]= {{2,3,4,5,6,7},{3,4,5,6,7,8},{1,2,3,4,5,6},{4,5,6,7,8,9},{5,6,7,8,9,10},{6,7,11,8,9,10}};
int max=0,m=0,n=0,count1=0,count2=0,a=0,b=0;
for(m=0,n=0; count2<6; m++)
{
for(n=0; count1<6; n++)
{
count1++;
if(max<A[m][n])
{
max=A[m][n];
a=m,b=n;
}
}
count1=0;
count2++;
n=n-1;
for(m=0; m<6; m++)
{
if(max>A[m][b])
{
max = 0;
m = count2 - 1;
break;
}
else
{
while(m == 5)
{
printf("%d\n",max);
printf("%d,%d\n",a,b);
break;
}
}
}
}
return 0;
}