C++实现马鞍数查找算法 - 寻找矩阵中的特殊元素 - 常规

{"title":"C++实现马鞍数查找算法 - 寻找矩阵中的特殊元素","description":"本文介绍了使用C++语言实现马鞍数查找算法的代码示例。马鞍数是指在矩阵中行上最小而在列上最大的元素。文章提供了代码和示例，并解释了算法原理。","keywords":"马鞍数, 矩阵, 算法, C++, 代码示例, 查找, 特殊元素","content":"#include \n#include \n\nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<vector> matrix(n, vector(m));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n cin >> matrix[i][j];\n }\n }\n\n vector row_min(n, INT_MAX);\n vector col_max(m, INT_MIN);\n\n // 找出每一行的最小值和每一列的最大值\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n row_min[i] = min(row_min[i], matrix[i][j]);\n col_max[j] = max(col_max[j], matrix[i][j]);\n }\n }\n\n bool exist = false;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (matrix[i][j] == row_min[i] && matrix[i][j] == col_max[j]) {\n cout << i+1 << " " << j+1 << " " << matrix[i][j] << endl;\n exist = true;\n }\n }\n }\n\n if (!exist) {\n cout << "not exit" << endl;\n }\n\n return 0;\n}"}