LeetCode 419 甲板上的战舰

由于战舰的位置只能是横着或者竖着，借助一个二维的数组记录已经访问过的点，即可统计出战舰的个数。

下面是本人AC的code

class Solution:
    def countBattleships(self, board: List[List[str]]) -> int:
        if not board or not board[0]:
            return 0
        m = len(board)
        n = len(board[0])
        cnt = 0
        visited = [[0] * n for _ in range(m)]
        for i in range(m):
            for j in range(n):
                if visited[i][j] == 0 and board[i][j] == 'X':
                    visited[i][j] = 1
                    cnt += 1
                    if j < n-1:
                        p = j + 1
                        while board[i][p] == 'X':
                            visited[i][p] = 1
                            p += 1
                            if p > n - 1:
                                break
                    if i < m-1:
                        q = i + 1
                        while board[q][j] == 'X':
                            visited[q][j] = 1
                            q += 1
                            if q > m - 1:
                                break
        return cnt

看到官方给的题解，我感觉我被无情的羞辱了，2行代码AC，我不得不说PYTHON NB！

在考虑边界条件得情况下，统计当前位置的值为‘X’，并且上边和左边元素不为‘X’，统计战舰数量，直接看代码

class Solution:
    def countBattleships(self, board: List[List[str]]) -> int:
        return sum(ch == 'X' and not (i > 0 and board[i - 1][j] == 'X' or j > 0 and board[i][j - 1] == 'X')
                   for i, row in enumerate(board) for j, ch in enumerate(row))