We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 891b819 commit d2b3c80Copy full SHA for d2b3c80
src/main/java/com/fishercoder/solutions/_542.java
@@ -4,38 +4,6 @@
4
import java.util.LinkedList;
5
import java.util.List;
6
7
-/**
8
- * 542. 01 Matrix
9
- *
10
- * Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.
11
-
12
- The distance between two adjacent cells is 1.
13
- Example 1:
14
- Input:
15
16
- 0 0 0
17
- 0 1 0
18
19
- Output:
20
21
22
23
- Example 2:
24
25
26
27
28
- 1 1 1
29
30
31
32
- 1 2 1
33
34
- Note:
35
- The number of elements of the given matrix will not exceed 10,000.
36
- There are at least one 0 in the given matrix.
37
- The cells are adjacent in only four directions: up, down, left and right.
38
- */
39
public class _542 {
40
41
public static class Solution1 {
0 commit comments