419. Battleships in a Board

Posted 无惧风云

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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?

class Solution {
public:
    int countBattleships(vector<vector<char>>& board) {
        int count = 0;
    for(int i=0;i<board.size();i++)
        for(int j=0;j<board[0].size();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的主要内容,如果未能解决你的问题,请参考以下文章

419. Battleships in a Board

419. Battleships in a Board

[leetcode-419-Battleships in a Board]

419. Battleships in a Board

[LeetCode]419 Battleships in a Board(暴力,dfs)

419 Battleships in a Board 甲板上的战舰