LeetCode Set Matrix Zeroes

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.

Follow up:

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 m,n,i,j,x,y;
        bool found = false;
        m = matrix.size();
        n = matrix[0].size();
        for(i = 0; i < m; i++) {
            for(j = 0; j < n; j++) {
                if(matrix[i][j]==0) {
                    found = true;
                    x = i;
                    y = j;
                    break;
                }
            }
            if(found)break;
        }
        if(!found) return;
        for( ; i < m; i++) {
            for( ; j < n; j++) {
                if(matrix[i][j] == 0) {
                    matrix[x][j] = 0;
                    matrix[i][y] = 0;
                    cout << i << ", " << j << endl;
                }
            }
            j = 0;
        }
        for(i = 0; i < n; i++) {
            if(i != y && matrix[x][i] == 0) {
                for(j = 0; j < m; j++) {
                    matrix[j][i] = 0;
                }
            }
        }
        for(j = 0; j < m; j++) {
            if(matrix[j][y] == 0) {
                for(i = 0; i < n; i++) {
                    matrix[j][i] = 0;
                }
            }
        }
        for(j = 0; j < m; j++) {
            matrix[j][y] = 0;
        }
    }
};

思路：解法空间复杂度O(1)。

O(mn)解法为：备份一个相同的矩阵m，以m为参照，对matrix进行修改。
O(m+n)解法为：设两个数组a[m], b[n]分别存储置零列和置零行，然后参照a[m], b[n]对matrix进行修改。

O(1)解法为：找到第一个为0的矩阵元素，将其所在行和所在列作为O(m+n)中的b[n], a[m]，之后的步骤与O(m+n)的解法相同。