class Solution {
public void setZeroes(int[][] matrix) {
int m = matrix.length, n = matrix[0].length;
Set<Integer> xSet = new HashSet<>();
Set<Integer> ySet = new HashSet<>();
for (int x = 0; x < m; x++) {
for (int y = 0; y < n; y++) {
if (matrix[x][y] == 0) {
xSet.add(x);
ySet.add(y);
}
}
}
for (int x : xSet) {
for (int y = 0; y < n; y++) {
matrix[x][y] = 0;
}
}
for (int y : ySet) {
for (int x = 0; x < m; x++) {
matrix[x][y] = 0;
}
}
}
}
73. 矩阵置零
最新推荐文章于 2024-10-14 23:22:13 发布