Battleships in a Board

https://leetcode.com/problems/battleships-in-a-board/description/

题解：题目的意思是给定一个矩阵，其中只有’.’和’X’两种符号。X只会形成1×N矩阵或者N×1矩阵，且互相不相邻。要求返回有多少个这样的矩阵。我们只要录入每个X矩阵的第一个X就可以得出有多少个矩阵。

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