-
Notifications
You must be signed in to change notification settings - Fork 1
/
BombEnemy.java
45 lines (41 loc) · 1.28 KB
/
BombEnemy.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
public class Solution {
public int maxKilledEnemies(char[][] grid) {
if (grid == null || grid.length == 0 || grid[0].length == 0) return 0;
int max = 0;
int row = 0;
int[] col = new int[grid[0].length];
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == 'W') continue;
if (j == 0 || grid[i][j - 1] == 'W') {
row = killedEnemiesRow(grid, i, j);
}
if (i == 0 || grid[i - 1][j] == 'W') {
col[j] = killedEnemiesCol(grid, i, j);
}
if (grid[i][j] == '0') {
max = Math.max(row + col[j], max);
}
}
}
return max;
}
//calculate killed enemies for row i from column j
private int killedEnemiesRow(char[][] grid, int i, int j) {
int num = 0;
while (j <= grid[0].length - 1 && grid[i][j] != 'W') {
if (grid[i][j] == 'E') num++;
j++;
}
return num;
}
//calculate killed enemies for column j from row i
private int killedEnemiesCol(char[][] grid, int i, int j) {
int num = 0;
while (i <= grid.length - 1 && grid[i][j] != 'W') {
if (grid[i][j] == 'E') num++;
i++;
}
return num;
}
}