419. Battleships in a Board

最新推荐文章于 2024-07-24 17:53:27 发布

原创最新推荐文章于 2024-07-24 17:53:27 发布 · 109 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

数据结构&算法专栏收录该内容

94 篇文章

订阅专栏

本文介绍了一种用于计数二维棋盘中战舰数量的算法。战舰由字符'X'表示，空位由'.'表示。算法通过检查每个'X'是否为战舰头部来避免重复计数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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?

写的和答案基本一致

从左上到右下如果’X’的左边或上方有’X’ 那么忽略不做重复计算

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