419. Battleships in a Board

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) orNx1 (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 not a valid board - as battleships will always have a cell separating between them.

Your algorithm should not modify the value of the board.

思路：

逐行逐列检查，如果是第一行或者第一列，视为一个，如果不是首行首列，那么检查同列上一行，或者同行上一列是否有X，如果有，那么上一行或者上一列的X已经计数。

public class Solution {
    public int countBattleships(char[][] board) {
        int m = board.length;
	if (m == 0)
		return 0;
	int n = board[0].length;
	int count = 0;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			if (board[i][j] == '.')
				continue;
			if (i > 0 && board[i - 1][j] == 'X')
				continue;
			if (j > 0 && board[i][j - 1] == 'X')
				continue;
			count++;
		}
	}
	return count;
    }
}