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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
| public class Solution {
int[][] map;
int size;
int[] lasers;
int[] tracker;
int[] v;
int ret = 0;
final int VAPOR = 1;
public static void main(String args[]) {
Solution s = new Solution();
System.out.println(s.solution(new int[][]{
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
{0, 0, 0, 0, 0, 0, 4, 0, 0, 0},
{0, 0, 0, 0, 0, 4, 4, 0, 0, 0},
{0, 0, 0, 0, 3, 0, 4, 0, 0, 0},
{0, 0, 0, 2, 3, 0, 0, 0, 5, 5},
{1, 2, 2, 2, 3, 3, 0, 0, 0, 5},
{1, 1, 1, 0, 0, 0, 0, 0, 0, 5}}));
}
public int solution(int[][] board) {
map = board;
size = board.length;
lasers = new int[size];
v = new int[201];
do {
setLaser();
}while(evaporate());
return ret;
}
public void setLaser() {
lasers = new int[size];
tracker = new int[size];
for(int i = 0; i < size; i++) {
for(int j = 0; j < size; j++) {
if(map[j][i] != 0 && v[map[j][i]] != VAPOR) {
tracker[i] = map[j][i];
break;
}
lasers[i]++;
}
System.out.print(lasers[i] + " ");
}
System.out.println();
}
public boolean evaporate() {
for(int col = 0; col < size - 1; col++) {
int row1 = lasers[col];
int row2 = lasers[col + 1];
int row3 = col == size - 2 ? -1 : lasers[col + 2];
int b1 = tracker[col];
int b2 = tracker[col + 1];
int b3 = col == size - 2 ? -1 : tracker[col];
if(b1 == 0) {
continue;
}
/* if(b1 == b2) {
if(row1 - 2 == row2) {
v[b1] = VAPOR;
ret++;
return true;
}
if(row1 + 2 == row2) {
v[b1] = VAPOR;
ret++;
return true;
}
}*/
if(b1 == b2 && b2 == b3) {
if(row1 + 1 == row2 && row2 == row3) {
v[b1] = VAPOR;
ret++;
return true;
}
if(row1 == row2 && row2 - 1 == row3) {
v[b1] = VAPOR;
ret++;
return true;
}
if(row1 - 1 == row2 && row1 == row3) {
v[b1] = VAPOR;
ret++;
return true;
}
}
}
return false;
}
}
|
