-
-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathSolution_73.java
93 lines (82 loc) · 1.73 KB
/
Solution_73.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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
import java.util.Arrays;
/**
* ClassName: Solution_73
* Data: 2020/7/28
* author: Oh_MyBug
* version: V1.0
*/
/*
73. 矩阵置零
给定一个 m x n 的矩阵,如果一个元素为 0,则将其所在行和列的所有元素都设为 0。请使用原地算法。
示例 1:
输入:
[
[1,1,1],
[1,0,1],
[1,1,1]
]
输出:
[
[1,0,1],
[0,0,0],
[1,0,1]
]
示例 2:
输入:
[
[0,1,2,0],
[3,4,5,2],
[1,3,1,5]
]
输出:
[
[0,0,0,0],
[0,4,5,0],
[0,3,1,0]
]
*/
public class Solution_73 {
// O(m*n)
public void setZeroes(int[][] matrix) {
int m = matrix.length;
int n = matrix[0].length;
int[] rows = new int[m*n];
int[] cols = new int[m*n];
int size = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (matrix[i][j] == 0){
rows[size] = i;
cols[size] = j;
size ++;
}
}
}
for (int i = 0; i < size; i++)
for (int j = 0; j < n; j++)
matrix[rows[i]][j] = 0;
for (int i = 0; i < size; i++)
for (int j = 0; j < m; j++)
matrix[j][cols[i]] = 0;
}
public static void main(String[] args) {
int[][] matrix = new int[][]{
{0,1,2,0},
{3,4,5,2},
{1,3,1,5}
};
Solution_73 solution_73 = new Solution_73();
solution_73.setZeroes(matrix);
Arrays.asList(matrix).forEach(m->{
System.out.println(Arrays.toString(m));
});
}
/*
{0,1,2,0},
{3,4,5,2},
{1,3,1,5}
{1,1,1},
{1,0,1},
{1,1,1}
*/
}