找马鞍点：1.　　若在矩阵Am×n中存在一个元素A[i][j]，其满足A[i][j]是第i行元素中最小值，且又是第j列元素中最大值，则称此元素为该矩阵的一个马鞍点。用二维数组存储矩阵Am×n ，设计算法求出矩阵中所有马鞍点。-Find a saddle point: 1. If in the matrix Am × n, there is a element of A [i] [j], the meet A [i] [j] is the first line element in the minimum value i, j is the first且又out elements maximum, then this element of the matrix of a saddle point. Two-dimensional array of storage matrix Am × n, the design algorithm to derive all the saddle point matrix.