Repository navigation
Expand file tree
/
Copy pathRottingOranges.java
More file actions
90 lines (79 loc) · 3.13 KB
/
Copy pathRottingOranges.java
File metadata and controls
90 lines (79 loc) · 3.13 KB
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
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Objects;
import java.util.Queue;
import java.util.Set;
public class RottingOranges {
private static final int EMPTY_CELL = 0;
private static final int FRESH_ORANGE = 1;
private static final int ROTTEN_ORANGE = 2;
private static final class Orange {
private final int row;
private final int column;
private final int minutes;
private Orange(int row, int column, int minutes) {
this.row = row;
this.column = column;
this.minutes = minutes;
}
@Override
public boolean equals(Object obj) {
if (obj == this) return true;
if (obj == null || obj.getClass() != this.getClass()) return false;
var that = (Orange) obj;
return this.row == that.row && this.column == that.column;
}
@Override
public int hashCode() {
return Objects.hash(row, column);
}
}
public static int orangesRotting(int[][] grid) {
final Queue<Orange> oranges = allRottingOranges(grid);
final Set<Orange> visited = new HashSet<>();
int result = 0;
while (!oranges.isEmpty()) {
Orange orange = oranges.poll();
if (!isValidPosition(orange, grid) || visited.contains(orange) || isEmptyCell(grid, orange)) {
continue;
}
visited.add(orange);
grid[orange.row][orange.column] = ROTTEN_ORANGE;
oranges.add(new Orange(orange.row - 1, orange.column, orange.minutes + 1));
oranges.add(new Orange(orange.row, orange.column + 1, orange.minutes + 1));
oranges.add(new Orange(orange.row + 1, orange.column, orange.minutes + 1));
oranges.add(new Orange(orange.row, orange.column - 1, orange.minutes + 1));
result = Math.max(result, orange.minutes);
}
if (allAreRotten(grid)) return result;
return -1;
}
private static boolean allAreRotten(int[][] grid) {
for (int[] row : grid) {
for (int orange : row) {
if (orange == FRESH_ORANGE) return false;
}
}
return true;
}
private static Queue<Orange> allRottingOranges(int[][] grid) {
final Queue<Orange> rottenOranges = new LinkedList<>();
for (int row = 0 ; row < grid.length ; row++) {
for (int column = 0 ; column < grid[0].length ; column++) {
if (grid[row][column] == ROTTEN_ORANGE) {
rottenOranges.add(new Orange(row, column, 0));
}
}
}
return rottenOranges;
}
private static boolean isValidPosition(Orange orange, int[][] grid) {
return orange.row >= 0 && orange.row < grid.length && orange.column >= 0 && orange.column < grid[0].length;
}
private static boolean isRotten(int[][] grid, Orange orange) {
return grid[orange.row][orange.column] == ROTTEN_ORANGE;
}
private static boolean isEmptyCell(int[][] grid, Orange orange) {
return grid[orange.row][orange.column] == EMPTY_CELL;
}
}