Problem
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?
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?
Algorithm
Constant space solution, use the first row and first column as the O(m+n) storage space. Since the information of the first row and column are vanished, we need two boolean variables to store whether first row and column has zeros before we start.
No comments:
Post a Comment