本题要求如下:
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
Follow up:
我开始想的比较直观的算法是,建立两个hashmap,一个存储m个对应的row是否应该清零,另外一个存储n个对应column是否应该置零,遍历一遍后,根据两个hashmap的数据把对应的row, column置零。绞尽脑汁,没有想到很好的in-place的方法,后来去看了看讨论区,发现in-place的方法果然很简单。
Did you use extra space?
A straight forward solution using O(mn) space is probably a bad idea.
A simple improvement uses O(m + n) space, but still not the best solution.
Could you devise a constant space solution?
class Solution {
public:
void setZeroes(vector<vector<int> > &matrix) {
int row = matrix.size();
int column = matrix[0].size();
bool row_0 = false;
bool column_0 = false;
for (int i = 0; i < row; ++i) {
if (matrix[i][0] == 0) {
column_0 = true;
break;
}
}
for (int j = 0; j < column; ++j) {
if (matrix[0][j] == 0) {
row_0 = true;
break;
}
}
for (int i = 1; i < row; ++i) {
for (int j = 1; j < column; ++j) {
if (matrix[i][j] == 0) {
matrix[0][j] = matrix[i][0] = 0;
}
}
}
for (int i = 1; i < row; ++i) {
for (int j = 1; j < column; ++j) {
if (matrix[i][0] == 0 || matrix[0][j] == 0) {
matrix[i][j] = 0;
}
}
}
if (row_0 == true) {
for (int j = 0; j < column; ++j) {
matrix[0][j] = 0;
}
}
if (column_0 == true) {
for (int i = 0; i < row; ++i) {
matrix[i][0] = 0;
}
}
}
};
本题的代码算是比较长的,但是算法的思路很简单。仍然是要创建两个hashmap,但是这两个hashmap是充分利用matrix的已有空间。。。算法如下:
1,检测matrix的第一行,如果其中有0,则把row_0置为true;检查第一列,如果有0,则把column_0置为true
2,然后把第一行和第一列作为(m-1)*(n-1)的hashmap,和我最开始提出的算法一样操作
3,当把(m-1)*(n-1)的matrix置零完毕后,开始检查row_0, column_0,如果row_0为true,则把第一行全部置零,column_0同理。。