Skip to content

Commit 88ba6b6

Browse files
refactor 361
1 parent c62508b commit 88ba6b6

File tree

1 file changed

+0
-16
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-16
lines changed

src/main/java/com/fishercoder/solutions/_361.java

-16
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,5 @@
11
package com.fishercoder.solutions;
22

3-
/**
4-
* 361. Bomb Enemy
5-
*
6-
* Given a 2D grid, each cell is either a wall 'W', an enemy 'E' or empty '0' (the number zero), return the maximum enemies you can kill using one bomb.
7-
The bomb kills all the enemies in the same row and column from the planted point until it hits the wall since the wall is too strong to be destroyed.
8-
Note that you can only put the bomb at an empty cell.
9-
10-
Example:
11-
For the given grid
12-
13-
0 E 0 0
14-
E 0 W E
15-
0 E 0 0
16-
17-
return 3. (Placing a bomb at (1,1) kills 3 enemies)
18-
*/
193
public class _361 {
204

215
public static class Solution1 {

0 commit comments

Comments
 (0)