ds2_6.cpp

这是清华大学出版社的《数据结构》的电子文档讲义

// ds2_6.cpp : Defines the entry point for the console application.
//上机题1:求矩阵的鞍点。

#include "stdafx.h"
#include "Array.h"

template<class Type> void andian(matrix<Type> & mat) {
	unsigned  i,j,k,l,m,n,found;	Type temp;
	m=mat.numberOfRows();	n=mat.numberOfColums();
	for ( i=0; i<m; i++ ) {	
		found=1;	temp=mat[i][0];	k=0;
		for ( j=0; j<n; j++ ) 
			if ( mat[i][j]<temp ) { temp=mat[i][j];  k=j; }
		for (l=0; l<m; l++) 
			if (mat[l][k]>temp) {found=0; break; }
		if (found)	{
			cout<<"鞍点是mat["<<i<<"]["<<k<<"]="<<temp<<endl;
			return;	}
		}
	cout<<"本矩阵无鞍点。"<<endl;
	}

int main( int aegc, char* argv[] ) {
	unsigned m,n;
	cout<<"请输入矩阵的行数m…"<<endl; 	
//	m=4;
	cin>>m;											
	cout<<"请输入矩阵的列数n…"<<endl; 	
//	n=4;
	cin>>n;											
	matrix<int> a(m, n);
//	a[0][0]=5; a[0][1]=2; a[0][2]=8; a[0][3]=6;
//	a[1][0]=3; a[1][1]=5; a[1][2]=7; a[1][3]=4;
//	a[2][0]=8; a[2][1]=6; a[2][2]=7; a[2][3]=9;
//	a[3][0]=7; a[3][1]=1; a[3][2]=6; a[3][3]=3;
	for ( unsigned j=0; j<m; j++ ) {
		cout<<"请输入矩阵"<<j<<"行的n个元素…"<<endl; 	
		for ( unsigned k=0; k<n; k++ )			//5   2   8   6
			cin>>a[j][k];						//3   5   7   4
		cout<<endl;								//8   6   7   9
		}										//7   1   6   3
	andian(a);
	return 0;
	}