I used 2 arrays to store row and column numbers. Then loop through the matrix and remember 0's row/column indexes. Finally loop through matrix again to fill in 0. The space complexity is O(row + column) and time complexity is O(2*n), n = size of matrix.

I do not post my solution since it is similar to other people. Does anyone try to solve this problem via constant space and O(n) time? Even though I doubt if such solution can be found, it is high possible to be asked to optimize this solution in an interview, I guess.