Given an 2D board, count how many different battleships are in it. The battleships are represented with ‘X’s, empty slots are represented with ‘.’s. You may assume the following rules:

You receive a valid board, made of only battleships or empty slots.

Battleships can only be placed horizontally or vertically. In other words, they can only be made of the shape 1xN (1 row, N columns) or Nx1 (N rows, 1 column), where N can be of any size.

At least one horizontal or vertical cell separates between two battleships – there are no adjacent battleships.

Example:

X..X

…X

…X

In the above board there are 2 battleships.

Invalid Example:

…X

XXXX

…X

This is an invalid board that you will not receive – as battleships will always have a cell separating between them.

思路: 找多少有多少条battleship，这个题目解法跟island题目完全相同。 用BFS或者DFS来遍历, 题目要求不准改动board的值，可以用个boolean的visited数组来解决；

public class Solution {
private int[] xDir = new int[]{0, -1, 0, 1};
private int[] yDir = new int[]{1, 0, -1, 0};
public int countBattleships(char[][] board) {
if (board == null || board.length == 0 || board[0] == null || board[0].length == 0) return 0;
int row = board.length;
int col = board[0].length;
int count = 0;
boolean[][] visited = new boolean[row][col];
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
if (!visited[i][j] && board[i][j] == 'X') {
countBattleships(board, visited, i, j);
count++;
}
}
}
return count;
}
public void countBattleships(char[][] board, boolean[][] visited, int x, int y) {
if (x < 0 || y < 0 || x >= board.length || y >= board[0].length) return;
if (board[x][y] == '.' || visited[x][y]) return;
visited[x][y] = true;
for (int i = 0; i < 4; i++) {
int newX = x + xDir[i];
int newY = y + yDir[i];
countBattleships(board, visited, newX, newY);
}
}
}

### Like this:

Like Loading...