419. Battleships in a Board 难度：medium

题目：

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:

...XXXXX...X

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

思路：

从左向右，从上向下遍历board，只需要判断当前所在位置是否为X 以及是否能使得battership的数量增加

程序：

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