419. Battleships in a Board

本文主要是介绍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.

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.

Follow up:
Could you do it in one-pass, using only O(1) extra memory and without modifying the value of the board?

Subscribe to see which companies asked this question.

---

思路

找船的个数，本质上就是找能够构成船的起点，最左上角的点的个数

---

代码

class Solution {
public:int countBattleships(vector<vector<char>>& board) {size_t row = board.size();if(row == 0){return 0;}size_t col = board[0].size();size_t count = 0;for(size_t i=0;i<row;i++){for(size_t j=0;j<col;j++){if(board[i][j] == 'X'&& (i == 0 || board[i-1][j] != 'X')&& (j == 0 || board[i][j-1] != 'X')){count++;}}}return count;}
};

这篇关于419. Battleships in a Board的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---