leetcode 419. Battleships in a Board

最新推荐文章于 2021-12-18 15:41:24 发布

BerryRobot

最新推荐文章于 2021-12-18 15:41:24 发布

阅读量529

点赞数

分类专栏： leetcode 文章标签： leetcode 详解

本文链接：https://blog.youkuaiyun.com/androidcon/article/details/53811984

版权

leetcode 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种在二维字符矩阵中高效统计战舰数量的方法。通过仅统计满足特定条件的‘X’（即战舰头部），该算法能够在一次遍历内、使用常数额外空间完成任务，且不会改变输入矩阵。

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

leetcode 419. Battleships in a Board

Question

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.

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

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.

问题

现在用一个包含’X’和’.’的二维字符矩阵来表示一组战舰群。每条战舰用横向或纵向的’X’表示。每条战舰之间至少用一个’.’字符隔开。问是否能够在一次遍历、O(1)空间复杂度、不修改输入的情况下找出有多少条战舰。

分析

我首先思考的问题是为什么要用一个‘.’将战舰隔开。原因很简单，因为如果战舰相互邻接，战舰的数量将会变得不确定。
那么如何才能在遍历一次情况下统计出战舰的数量呢？有一个很巧妙的想法：数船头。因为船头是非常好判断的，船头的左边和上边必然是’.’，而且这是个充要条件。船身必然不符合这个条件，因为横向战舰的船身的左边一定是’X’，纵向战舰的船身的上边一定是’X’。这样一来，只要一次遍历整个二维数组，统计船头的个数就行了。

代码

int countBattleships(vector<vector<char>>& board) {
        int cnt = 0;
        for (int i = 0; i < board.size(); i++)
        {
            vector<char> &row = board[i];
            for (int j = 0; j < row.size(); j++)
            {
                if (board[i][j] == 'X' &&
                (i == 0 || (i > 0 && board[i - 1][j] == '.')) &&
                (j == 0 || (j > 0 && board[i][j - 1] == '.')))
                {
                    cnt++;
                }
            }
        }

        return cnt;
    }