Skip to content

Latest commit

 

History

History
114 lines (91 loc) · 6.86 KB

README_EN.md

File metadata and controls

114 lines (91 loc) · 6.86 KB
Raw

999. Available Captures for Rook

中文文档

Description

On an 8 x 8 chessboard, there is exactly one white rook 'R' and some number of white bishops 'B', black pawns 'p', and empty squares '.'.

When the rook moves, it chooses one of four cardinal directions (north, east, south, or west), then moves in that direction until it chooses to stop, reaches the edge of the board, captures a black pawn, or is blocked by a white bishop. A rook is considered attacking a pawn if the rook can capture the pawn on the rook's turn. The number of available captures for the white rook is the number of pawns that the rook is attacking.

Return the number of available captures for the white rook.

 

Example 1:

Input: board = [[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
Output: 3
Explanation: In this example, the rook is attacking all the pawns.

Example 2:

Input: board = [[".",".",".",".",".",".",".","."],[".","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",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
Output: 0
Explanation: The bishops are blocking the rook from attacking any of the pawns.

Example 3:

Input: board = [[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","p",".",".",".","."],["p","p",".","R",".","p","B","."],[".",".",".",".",".",".",".","."],[".",".",".","B",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."]]
Output: 3
Explanation: The rook is attacking the pawns at positions b5, d6, and f5.

 

Constraints:

  • board.length == 8
  • board[i].length == 8
  • board[i][j] is either 'R', '.', 'B', or 'p'
  • There is exactly one cell with board[i][j] == 'R'

Solutions

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;
    }
}

...