class Solution {
public:
vector<vector<int>> constructProductMatrix(vector<vector<int>>& grid) {
int n = grid.size(), m = grid[0].size();
vector<vector<int>> p(n, vector<int>(m));
int x = 1, y = 1;
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++) {
p[i][j] = x;
x = grid[i][j] % 12345 * x % 12345;
}
}
for (int i = n - 1; i >= 0; i--){
for (int j = m - 1; j >= 0; j--) {
p[i][j] = p[i][j] % 12345 * y % 12345;
y = grid[i][j] % 12345 * y % 12345;
}
}
return p;
}
};
LeetCode-2906:构造乘积矩阵
最新推荐文章于 2024-10-10 22:59:02 发布