if(temp==i){printf("鞍点为%d行%d列的%d\n",i+1,j+1,a[i][j]);count++;
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);} ...