Skip to content

Latest commit

 

History

History
124 lines (95 loc) · 6.79 KB

README.md

File metadata and controls

124 lines (95 loc) · 6.79 KB
Raw

999. 车的可用捕获量

English Version

题目描述

在一个 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 的卒。

 

提示：

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

解法

先找到 R 的位置，之后向“上、下、左、右”四个方向查找，累加结果。

Python3

class Solution:
    def numRookCaptures(self, board: List[List[str]]) -> int:

        def search(board, i, j, direction):
            while i >= 0 and i < 8 and j >= 0 and j < 8:
                if board[i][j] == 'B': return 0
                if board[i][j] == 'p': return 1
                i += direction[0]
                j += direction[1]
            return 0
        directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]
        res = 0;
        for i in range(8):
            for j in range(8):
                if board[i][j] == 'R':
                    for direction in directions:
                        res += search(board, i, j, direction)
                    return res

Java

class Solution {
    public int numRookCaptures(char[][] board) {
        int[][] directions = { {-1, 0}, {1, 0}, {0, -1}, {0, 1} };
        int res = 0;
        for (int i = 0; i < 8; ++i) {
            for (int j = 0; j < 8; ++j) {
                if (board[i][j] == 'R') {
                    for (int[] direction : directions) {
                        res += search(board, i, j, direction);
                    }
                    return res;
                }
            }
        }
        return res;
    }

    private int search(char[][] board, int i, int j, int[] direction) {
        while (i >= 0 && i < 8 && j >= 0 && j < 8) {
            if (board[i][j] == 'B') return 0;
            if (board[i][j] == 'p') return 1;
            i += direction[0];
            j += direction[1];
        }
        return 0;
    }
}

...