Battleships in a Board LeetCode solution in Java

1
class Solution {
2
  public int countBattleships(char[][] board) {
3
    int result = 0;
4
    for (int i = 0; i < board.length; i++) {
5
      for (int j = 0; j < board[i].length; j++) {
6
        if (board[i][j] == 'X') {
7
          remover(i, j, board);
8
          result++;
9
        }
10
      }
11
    }
12
    return result;
13
  }
14

15
  public void remover(int i, int j, char[][] board) {
16
    if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] == '.') {
17
      return;
18
    }
19
    board[i][j] = '.';
20
    remover(i + 1, j, board);
21
    remover(i, j + 1, board);
22
  }
23
}