[LeetCode] Problem 999 - Available Captures for Rook

Posted on | In ,

On an 8 x 8 chessboard, there is one white rook. There also may be empty squares, white bishops, and black pawns. These are given as characters ‘R’, ‘.’, ‘B’, and ‘p’ respectively. Uppercase characters represent white pieces, and lowercase characters represent black pieces.

The rook moves as in the rules of Chess: it chooses one of four cardinal directions (north, east, west, and south), then moves in that direction until it chooses to stop, reaches the edge of the board, or captures an opposite colored pawn by moving to the same square it occupies. Also, rooks cannot move into the same square as other friendly bishops.

Return the number of pawns the rook can capture in one move.

Example

No.1

evGTL6.png

Input: 

1
2
3
4
5
6
7
8
[[".",".",".",".",".",".",".","."],
 [".",".",".","p",".",".",".","."],
 [".",".",".","R",".",".",".","p"],
 [".",".",".",".",".",".",".","."],
 [".",".",".",".",".",".",".","."],
 [".",".",".","p",".",".",".","."],
 [".",".",".",".",".",".",".","."],
 [".",".",".",".",".",".",".","."]]

Output: 3

Explanation:
In this example the rook is able to capture all the pawns.

No.2

evJQTU.png

Input: 

1
2
3
4
5
6
7
8
[[".",".",".",".",".",".",".","."],
 [".","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:
Bishops are blocking the rook to capture any pawn.

No.3

evJ61A.png

Input: 

1
2
3
4
5
6
7
8
[[".",".",".",".",".",".",".","."],
 [".",".",".","p",".",".",".","."],
 [".",".",".","p",".",".",".","."],
 ["p","p",".","R",".","p","B","."],
 [".",".",".",".",".",".",".","."],
 [".",".",".","B",".",".",".","."],
 [".",".",".","p",".",".",".","."],
 [".",".",".",".",".",".",".","."]]

Output: 3

Explanation:
The rook can capture the pawns at positions b5, d6 and f5.

Note

  1. board.length == board[i].length == 8
  2. board[i][j] is either ‘R’, ‘.’, ‘B’, or ‘p’
  3. There is exactly one cell with board[i][j] == ‘R’

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
public int numRookCaptures(char[][] board) {
    int result = 0;
    int[][] dirs = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

    loop:
    for (int i = 0; i < 8; i++) {
        for (int j = 0; j < 8; j++) {
            if (board[i][j] == 'R') {
                for (int[] dir : dirs)
                    result += findCapture(board, i, j, dir);
                break loop;
            }
        }
    }

    return result;
}

private int findCapture(char[][] board, int x, int y, int[] dir) {
    while (x >= 0 && y >= 0 && x < 8 && y < 8) {
        if (board[x][y] == 'p')
            return 1;
        else if (board[x][y] == 'B')
            return 0;
        
        x += dir[0];
        y += dir[1];
    }

    return 0;
}