forked from DengWangBao/Leetcode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBombEnemy.java
39 lines (37 loc) · 1.09 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
public class BombEnemy {
public int maxKilledEnemies(char[][] grid) {
int max = 0;
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[0].length; j++) {
if (grid[i][j] == '0') {
max = Math.max(max, killedEnemies(grid, i, j));
}
}
}
return max;
}
private int killedEnemies(char[][] grid, int i, int j) {
int count = 0;
for (int k = j - 1; k >= 0 && grid[i][k] != 'W'; k--) {
if (grid[i][k] == 'E') {
count++;
}
}
for (int k = j + 1; k < grid[0].length && grid[i][k] != 'W'; k++) {
if (grid[i][k] == 'E') {
count++;
}
}
for (int k = i - 1; k >= 0 && grid[k][j] != 'W'; k--) {
if (grid[k][j] == 'E') {
count++;
}
}
for (int k = i + 1; k < grid.length && grid[k][j] != 'W'; k++) {
if (grid[k][j] == 'E') {
count++;
}
}
return count;
}
}