if(temp==i){printf("鞍点为%d行%d列的%d\n",i+1,j+1,a[i][j]);count++;
if(k==0) //"标志"printf("none");//若K=0，就说明该数组没有鞍点 }
把printf("数组的鞍点为：\n");删除。把printf("%d",*(*(p+q)+k))改为printf("数组的鞍点为\n：%d\n",max)或printf("数组的鞍点为\n：%d\n",min)。
if(flag==1) printf("鞍点是 %d\n",a[maxh][maxl]);if(flag==0) printf("no number\n");flag=1;} }
k][maxj])break;if(k>=n) //是鞍点 { cout<<"a["<<i<<"]["<<maxj<<"]="<<max<<endl;flag=1;} } if(!flag) //没有鞍点 cout<<"No!\n";} void main(){ int a[3][4]={{1,2,3,4},{4,5,5,6},{3,5,6,7}};find(a,3);} ...
for(i=0;i<3;i++){printf("输入第%d行：\n",i+1);scanf("%d %d %d %d",&a[i][0],&a[i][1],&a[i][2],&a[i][3]);}//输入数组for(i=0;i<3;i++){j=max(i);temp=min(j);if(temp==i){printf("鞍点为%d行%d列的%d\n",i+1,j+1,a[i][j]);count++;...