forked from gouthampradhan/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSetMatrixZeroes.java
66 lines (58 loc) · 1.49 KB
/
SetMatrixZeroes.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package array;
import java.util.HashSet;
import java.util.Set;
/**
* Created by pradhang on 3/28/2017.
* Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.
click to show follow up.
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?
*/
public class SetMatrixZeroes
{
/**
* Main method
* @param args
* @throws Exception
*/
public static void main(String[] args) throws Exception
{
int[][] matrix = {{0, 8, 7}, {9, 0, 8}, {9, 9, 0}};
new SetMatrixZeroes().setZeroes(matrix);
}
public void setZeroes(int[][] matrix)
{
Set<Integer> row = new HashSet<>();
Set<Integer> col = new HashSet<>();
int m = matrix.length;
int n = matrix[0].length;
for(int i = 0; i < m; i ++)
{
for(int j = 0; j < n; j ++)
{
if(matrix[i][j] == 0)
{
row.add(i);
col.add(j);
}
}
}
for(int r : row)
{
for(int j = 0; j < n; j++)
{
matrix[r][j] = 0;
}
}
for(int c : col)
{
for(int i = 0; i < m; i++)
{
matrix[i][c] = 0;
}
}
}
}