[LeetCode]999. 车的可用捕获量

题目

在一个 8 x 8 的棋盘上，有一个白色的车（Rook），用字符 'R' 表示。棋盘上还可能存在空方块，白色的象（Bishop）以及黑色的卒（pawn），分别用字符 '.'，'B' 和 'p' 表示。不难看出，大写字符表示的是白棋，小写字符表示的是黑棋。

车按国际象棋中的规则移动。东，西，南，北四个基本方向任选其一，然后一直向选定的方向移动，直到满足下列四个条件之一：

• 棋手选择主动停下来。
• 棋子因到达棋盘的边缘而停下。
• 棋子移动到某一方格来捕获位于该方格上敌方（黑色）的卒，停在该方格内。
• 车不能进入/越过已经放有其他友方棋子（白色的象）的方格，停在友方棋子前。

你现在可以控制车移动一次，请你统计有多少敌方的卒处于你的捕获范围内（即，可以被一步捕获的棋子数）。

示例 1：

输入：[[".",".",".",".",".",".",".","."],
[".",".",".","p",".",".",".","."],
[".",".",".","R",".",".",".","p"],
[".",".",".",".",".",".",".","."],
[".",".",".",".",".",".",".","."],
[".",".",".","p",".",".",".","."],
[".",".",".",".",".",".",".","."],
[".",".",".",".",".",".",".","."]]
输出：3
解释：
在本例中，车能够捕获所有的卒。

示例 2：

输入：[[".",".",".",".",".",".",".","."],
[".","p","p","p","p","p",".","."],
[".","p","p","B","p","p",".","."],
[".","p","B","R","B","p",".","."],
[".","p","p","B","p","p",".","."],
[".","p","p","p","p","p",".","."],
[".",".",".",".",".",".",".","."],
[".",".",".",".",".",".",".","."]]
输出：0
解释：
象阻止了车捕获任何卒。

示例 3：

输入：[[".",".",".",".",".",".",".","."],
[".",".",".","p",".",".",".","."],
[".",".",".","p",".",".",".","."],
["p","p",".","R",".","p","B","."],
[".",".",".",".",".",".",".","."],
[".",".",".","B",".",".",".","."],
[".",".",".","p",".",".",".","."],
[".",".",".",".",".",".",".","."]]
输出：3
解释： 
车可以捕获位置 b5，d6 和 f5 的卒。

提示：

1. board.length == board[i].length == 8
2. board[i][j] 可以是 'R'，'.'，'B' 或 'p'
3. 只有一个格子上存在 board[i][j] == 'R'

解题思路

解法一：暴力穷举

先找出车所在的行与列，然后分四个方向遍历寻找，分三种情况：
1）要么当遇到象则退出本方向循环；
2）要么遇到第一个卒时，计数加一，然后退出本方向的循环；
3）要么到棋盘边缘也没遇到卒，则退出本次循环。
最后返回总个数即可。
复杂度分析
时间复杂度：O(n^2)，其中 n 是棋盘的边长。找白色车在棋盘中的位置需要 O(n^2)的时间复杂度，模拟车在四个方向上捕获颜色相反的卒需要 O(n) 的时间复杂度，所以一共需要 O(n^2+n) = O(n^2) 的时间复杂度。

空间复杂度：O(1)，只需要常数空间存放若干变量。

解法二：深度优先搜索DFS

先找出车所在的行与列，然后分四个方向对其进行深度搜索。
1）如果已经到达棋盘边缘，则返回；
1）如果碰到象，则返回；
2）如果碰到一个卒，计数加一，然后返回；
3）否则继续沿当前方向进行深度搜索，直到满足以上三个返回条件之一。
最后统计总个数即可。

代码

解法一：暴力穷举

class Solution:
    def numRookCaptures(self, board: List[List[str]]) -> int:
        m = len(board)
        n = len(board[0])
        a, b = 0, 0
        for i in range(m):
            for j in range(n):
                if board[i][j] == 'R':
                    a = i
                    b = j
                    break
        count = 0
        for k in range(b,-1,-1):
            if board[a][k] == 'B':
                break
            if board[a][k] == 'p':
                count += 1
                break
        for k in range(b,n):
            if board[a][k] == 'B':
                break
            if board[a][k] == 'p':
                count += 1
                break
        for t in range(a,-1,-1):       
            if board[t][b] == 'B':
                break
            if board[t][b] == 'p':
                count += 1
                break
        for t in range(a,m):      
            if board[t][b] == 'B':
                break
            if board[t][b] == 'p':
                count += 1
                break
        return count

解法二：深度优先搜索DFS

代码1

class Solution:
    def numRookCaptures(self, board: List[List[str]]) -> int:
        self.ans = 0
        def dfs(i, j, dx, dy):
            if i < 0 or i >= 8 or j < 0 or j >= 8: return
            if board[i][j] == 'B': return
            if board[i][j] == 'p':
                self.ans += 1
                return
            dfs(i + dx, j + dy, dx, dy)

        for i in range(8):
            for j in range(8):
                if board[i][j] == 'R':
                    dfs(i + 1, j, 1, 0)
                    dfs(i - 1, j, -1, 0)
                    dfs(i, j + 1, 0, 1)
                    dfs(i, j - 1, 0, -1)
        return self.ans

代码2

class Solution:
    def numRookCaptures(self, board: List[List[str]]) -> int:
        m = len(board)
        n = len(board[0])
        def dfs(i, j, dx, dy):
            count = 0
            if (i<0 or i>=8 or j<0 or j>=8):
                return count
            if board[i][j]=='B':
                return count
            if board[i][j]=='p':
                count = 1
                return count
            count += dfs(i+dx, j+dy, dx, dy)
            return count
  
        num = 0
        for i in range(m):
            for j in range(n):
                if board[i][j]=="R":
                    num += dfs(i, j+1, 0, 1)
                    num += dfs(i, j-1, 0, -1)
                    num += dfs(i+1, j, 1, 0)
                    num += dfs(i-1, j, -1, 0)
        return num