Given an m x n integer matrix, if an element is 0, set its entire row and column to 0.
For the Cheetcode runner, return the resulting matrix after applying the zeroing rules.
Mutating the matrix in place is fine, but return the final matrix so the runner can verify it.
Examples
Input: matrix = [[1,1,1],[1,0,1],[1,1,1]] Output: [[1,0,1],[0,0,0],[1,0,1]]
Input: matrix = [[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]]
Constraints
- 1 <= matrix.length, matrix[i].length <= 200
- -2,147,483,648 <= matrix[i][j] <= 2,147,483,647