【LeetCode】 73. Set Matrix Zeroes 矩阵置零(Medium)(JAVA)
题目地址: https://leetcode.com/problems/set-matrix-zeroes/
题目描述:
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.
Example 1:
Input:
[
[1,1,1],
[1,0,1],
[1,1,1]
]
Output:
[
[1,0,1],
[0,0,0],
[1,0,1]
]
Example 2:
Input:
[
[0,1,2,0],
[3,4,5,2],
[1,3,1,5]
]
Output:
[
[0,0,0,0],
[0,4,5,0],
[0,3,1,0]
]
Follow up:
1. A straight forward solution using O(mn) space is probably a bad idea.
2. A simple improvement uses O(m + n) space, but still not the best solution.
3. Could you devise a constant space solution?
题目大意
给定一个 m x n 的矩阵,如果一个元素为 0,则将其所在行和列的所有元素都设为 0。请使用原地算法。
解题方法
1、空间复杂度为 O(1),使用固定的空间
2、把第一行和第一列单独拿出来处理
3、把其他列是否为 0 的数据存在第一列和第一行
4、遍历其他行和其他列,判断存的数据是否为 0
class Solution {
public void setZeroes(int[][] matrix) {
if (matrix.length == 0 || matrix[0].length == 0) return;
boolean row = false;
boolean column = false;
for (int i = 0; i < matrix.length && !row; i++) {
if (matrix[i][0] == 0) row = true;
}
for (int i = 0; i < matrix[0].length && !column; i++) {
if (matrix[0][i] == 0) column = true;
}
for (int i = 1; i < matrix.length; i++) {
for (int j = 0; j < matrix[0].length && matrix[i][0] != 0; j++) {
if (matrix[i][j] == 0) matrix[i][0] = 0;
}
}
for (int j = 1; j < matrix[0].length; j++) {
for (int i = 0; i < matrix.length && matrix[0][j] != 0; i++) {
if (matrix[i][j] == 0) matrix[0][j] = 0;
}
}
for (int i = 1; i < matrix.length; i++) {
for (int j = 1; j < matrix[0].length; j++) {
if (matrix[0][j] == 0 || matrix[i][0] == 0) matrix[i][j] = 0;
}
}
for (int i = 0; i < matrix.length && row; i++) {
matrix[i][0] = 0;
}
for (int i = 0; i < matrix[0].length && column; i++) {
matrix[0][i] = 0;
}
}
}
执行用时 : 1 ms, 在所有 Java 提交中击败了 99.96% 的用户
内存消耗 : 42.4 MB, 在所有 Java 提交中击败了 97.21% 的用户