【九日集训】

1. 统计有序矩阵中的负数
   遍历矩阵，将所有复数统计出来

int countNegatives(vector<vector<int>>& grid) {
        int num=0;
        for (auto x:grid){
            for (auto y:x){
                if (y<0) num++;
            }
        }
        return num;
    }

2. 矩阵对角线元素的和
   遍历整个矩阵，将满足 i = j，i=j ， i + j = n - 1，i+j=n−1的坐标全部统计出来

   int diagonalSum(vector<vector<int>>& mat) {
        int n = mat.size(), sum = 0;
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < n; ++j) {
                if (i == j || i + j == n - 1) {
                    sum += mat[i][j];
                }
            }
        }
        return sum;
    }

3. 托普利茨矩阵
   判断上一行的第i个与下一行的第i-1个是否相等

bool isToeplitzMatrix(vector<vector<int>>& matrix) {
        int m = matrix.size(), n = matrix[0].size();
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (matrix[i][j] != matrix[i - 1][j - 1]) {
                    return false;
                }
            }
        }
        return true;
    }

4. 矩阵中的幸运数

 vector<int> luckyNumbers(vector<vector<int>>& matrix) {
        int r = matrix.size(), c = matrix[0].size();
        vector<int> rMin(r, INT_MAX);
        vector<int> cMax(c, 0);
        for (int i = 0; i < r; ++i) {
            for (int j = 0; j < c; ++j) {
                rMin[i] = min(rMin[i], matrix[i][j]);
                cMax[j] = max(cMax[j], matrix[i][j]);
            }
        }
        vector<int> ans;
        for (int i = 0; i < r; ++i) {
            for (int j = 0; j < c; ++j) {
                if (matrix[i][j] == rMin[i] && matrix[i][j] == cMax[j]) {
                    ans.push_back(matrix[i][j]);
                }
            }
        }
        return ans;
    }