999. 车的可用捕获量

最新推荐文章于 2020-03-31 12:27:32 发布

敲键盘的钢琴师

最新推荐文章于 2020-03-31 12:27:32 发布

阅读量87

点赞数

分类专栏： LeetCode 文章标签： leetCode python

本文链接：https://blog.csdn.net/hushaoqiqimingxing/article/details/88671139

版权

LeetCode 专栏收录该内容

167 篇文章 0 订阅

订阅专栏

在一个 8 x 8 的棋盘上，有一个白色车（rook）。也可能有空方块，白色的象（bishop）和黑色的卒（pawn）。它们分别以字符 “R”，“.”，“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 的卒。

提示：

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

class Solution:
    def numRookCaptures(self, board: 'List[List[str]]') -> 'int':
        # 有一个白色车（rook）
        pawn = 0
        for i in range(len(board)):
            if 'R' in board[i]:
                #print(i,board[i].index('R'))
                Ri, Rj = i, board[i].index('R')
                break
        # 上
        for i in range(Ri, 0, -1):
            if board[i][Rj] == 'B':
                break
            if board[i][Rj] == 'p':
                pawn += 1
                break
        # 下
        for i in range(Ri, len(board)):
            if board[i][Rj] == 'B':
                break
            if board[i][Rj] == 'p':
                pawn += 1
                break
        # 左
        for j in range(Rj, 0, -1):
            if board[Ri][j] == 'B':
                break
            if board[Ri][j] == 'p':
                pawn += 1
                break
        # 右
        for j in range(Rj, len(board[Ri])):
            if board[Ri][j] == 'B':
                break
            if board[Ri][j] == 'p':
                pawn += 1
                break
        return pawn

if __name__ == '__main__':
    s = Solution()
    # A = [[".",".",".",".",".",".",".","."],
    #      [".",".",".","p",".",".",".","."],
    #      [".",".",".","R",".",".",".","p"],
    #      [".",".",".",".",".",".",".","."],
    #      [".",".",".",".",".",".",".","."],
    #      [".",".",".","p",".",".",".","."],
    #      [".",".",".",".",".",".",".","."],
    #      [".",".",".",".",".",".",".","."]]
    A = [[".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", "p", ".", ".", ".", "."],
     [".", ".", ".", "p", ".", ".", ".", "."], ["p", "p", ".", "R", ".", "p", "B", "."],
     [".", ".", ".", ".", ".", ".", ".", "."], [".", ".", ".", "B", ".", ".", ".", "."],
     [".", ".", ".", "p", ".", ".", ".", "."], [".", ".", ".", ".", ".", ".", ".", "."]]
    #A = [[".",".",".",".",".",".",".","."],[".","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",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
    print(s.numRookCaptures(A))

认真读题，这道题一点也不难！！！