int a[3][3];
int b[3],c[3];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
a[i][j] = arc4random()%10;
printf("%d ",a[i][j]);
}
printf("\n");
}
// int a[3][3] = {1,8,6,2,7,3,4,9,5};//测试用
int max = 0,min = a[0][0];
for (int i = 0; i < 3; i++) {
min = a[0][i];
for (int j = 0; j < 3; j++) {
max = max > a[i][j] ? max : a[i][j];
min = min < a[j][i] ? min : a[j][i];
}
b[i] = max;
c[i] = min;
max = 0;
}
BOOL isTure = YES;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (a[i][j]==b[i]&&a[i][j]==c[j]) {
printf("这个数是鞍点:a[%d][%d]=%d\n",i,j,a[i][j]);
isTure = NO;
}
}
}
if (isTure == YES) {
printf("抱歉没有鞍点");
}
找出一个二维数组中的“鞍点”,即该位置上的元素在该行中最大,在该列中最小(也可能没鞍点),打印出有关信息。
最新推荐文章于 2023-06-11 08:23:27 发布