Leetcode学习笔记：#419. Battleships in a Board

Leetcode学习笔记：#419. Battleships in a Board

Given an 2D board, count how many 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.

实现：

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;
}

思路：
遍历矩阵，设第一个格子为最左上格子，之后只要判断矩阵中元素的左边和上边有没有X即可，如果有，说明这是一条船，没有说明不是。