LeetCode #419: Battleships in a Board

129 篇文章 0 订阅

Problem Statement

(Source) 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:

...X
XXXX
...X

This is not a valid board - as battleships will always have a cell separating between them.
Your algorithm should not modify the value of the board.

Solution

从左向右,从上向下遍历board,只需要判断当前所在位置是否为X 以及是否能使得battership的数量增加,判断逻辑见如下代码。算法的时间复杂度为board的cell数量。

class Solution(object):
    def countBattleships(self, board):
        """
        :type board: List[List[str]]
        :rtype: int
        """
        res = 0
        n, m = len(board), len(board[0])
        for i in xrange(n):
            for j in xrange(m):
                if board[i][j] == 'X':
                    if not ((i - 1 >= 0 and board[i - 1][j] == 'X') or (j - 1 >= 0 and board[i][j - 1] == 'X')):
                        res += 1
        return res     
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值