c++寻找二维数组的鞍点

以下是C++寻找二维数组鞍点的代码示例：

#include <iostream>
using namespace std;

int main()
{
    int matrix[5][5] = {{1, 2, 3, 4, 5},
                        {6, 7, 8, 9, 10},
                        {11, 12, 13, 14, 15},
                        {16, 17, 18, 19, 20},
                        {21, 22, 23, 24, 25}};
    int row, col, flag;
    for (int i = 0; i < 5; i++) {
        int max = matrix[i][0];
        col = 0;
        for (int j = 1; j < 5; j++) {
            if (matrix[i][j] > max) {
                max = matrix[i][j];
                col = j;
            }
        }
        flag = 1;
        for (int k = 0; k < 5; k++) {
            if (matrix[k][col] < max) {
                flag = 0;
                break;
            }
        }
        if (flag) {
            row = i;
            cout << "鞍点为：" << max << endl;
            cout << "所在行为：" << row << endl;
            cout << "所在列为：" << col << endl;
            break;
        }
    }
    if (!flag) {
        cout << "该矩阵没有鞍点" << endl;
    }
    return 0;
}