[leetcode] 419. Battleships in a Board @ python

原题

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?

解法1

遍历board, 每次遇到’X’时, count递增, 并将它相连的’X’全部标记为’#’.

代码

class Solution(object):
    def countBattleships(self, board):
        """
        :type board: List[List[str]]
        :rtype: int
        """
        def helper(x, y):            
            board[x][y] = '#'
            for dx, dy in [(-1,0), (1,0), (0,-1), (0,1)]:
                while 0<=x+dx<row and 0<=y+dy<col and board[x+dx][y+dy] == 'X':
                    x = x+dx
                    y = y+dy
                    board[x][y] = '#'                   
                    
                    
        row, col = len(board), len(board[0])
        count = 0
        for i in range(row):
            for j in range(col):
                if board[i][j] == 'X':
                    # mark the battleship
                    dfs(i, j)
                    count += 1
                    
        return count

解法2

遍历board, 每次只记录第一个遇到的X, 对于它后面相连的X, 无论是水平相连还是垂直相连, 都不计入count.

代码

class Solution(object):
    def countBattleships(self, board):
        """
        :type board: List[List[str]]
        :rtype: int
        """               
                   
        row, col = len(board), len(board[0])
        count = 0
        for i in range(row):
            for j in range(col):
                if board[i][j] == 'X':
                    flag = 1
                    # just count the first char of the row
                    if j >= 1 and board[i][j-1] == 'X': 
                        flag = 0
                    if i >= 1 and board[i-1][j] == 'X':
                        flag = 0
                    count += flag
                    
        return count
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值