g0901_1000.s0999_available_captures_for_rook.Solution Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
There is a newer version: 1.38
package g0901_1000.s0999_available_captures_for_rook;

// #Easy #Array #Matrix #Simulation #2022_03_31_Time_0_ms_(100.00%)_Space_41.8_MB_(28.74%)

/**
 * 999 - Available Captures for Rook\.
 *
 * Easy
 *
 * 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:**
 *
 * ![](https://assets.leetcode.com/uploads/2019/02/20/1253_example_1_improved.PNG)
 *
 * **Input:** board = \[\[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
 *
 * **Output:** 3
 *
 * **Explanation:** In this example, the rook is attacking all the pawns.
 *
 * **Example 2:**
 *
 * ![](https://assets.leetcode.com/uploads/2019/02/19/1253_example_2_improved.PNG)
 *
 * **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:**
 *
 * ![](https://assets.leetcode.com/uploads/2019/02/20/1253_example_3_improved.PNG)
 *
 * **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'`
**/
@SuppressWarnings("java:S135")
public class Solution {
    private int[] directions = new int[] {0, 1, 0, -1, 0};

    public int numRookCaptures(char[][] board) {
        int m = board.length;
        int n = board[0].length;
        int rowR = -1;
        int colR = -1;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (board[i][j] == 'R') {
                    rowR = i;
                    colR = j;
                    break;
                }
            }
        }
        int[] count = {0};
        for (int i = 0; i < 4; i++) {
            int neighborRow = rowR + directions[i];
            int neighborCol = colR + directions[i + 1];
            if (neighborRow >= 0
                    && neighborRow < m
                    && neighborCol >= 0
                    && neighborCol < n
                    && board[neighborRow][neighborCol] != 'B') {
                if (directions[i] == 0 && directions[i + 1] == 1) {
                    extracted(board, n, count, neighborRow, neighborCol);
                } else if (directions[i] == 1 && directions[i + 1] == 0) {
                    extracted1(board, m, count, neighborRow, neighborCol);
                } else if (directions[i] == 0 && directions[i + 1] == -1) {
                    extracted(board, count, neighborRow, neighborCol);
                } else {
                    extracted1(board, count, neighborRow, neighborCol);
                }
            }
        }
        return count[0];
    }

    private void extracted(char[][] board, int[] count, int neighborRow, int neighborCol) {
        while (neighborCol >= 0) {
            if (board[neighborRow][neighborCol] == 'p') {
                count[0]++;
                break;
            } else if (board[neighborRow][neighborCol] == 'B') {
                break;
            } else {
                neighborCol--;
            }
        }
    }

    private void extracted(char[][] board, int n, int[] count, int neighborRow, int neighborCol) {
        while (neighborCol < n) {
            if (board[neighborRow][neighborCol] == 'p') {
                count[0]++;
                break;
            } else if (board[neighborRow][neighborCol] == 'B') {
                break;
            } else {
                neighborCol++;
            }
        }
    }

    private void extracted1(char[][] board, int[] count, int neighborRow, int neighborCol) {
        while (neighborRow >= 0) {
            if (board[neighborRow][neighborCol] == 'p') {
                count[0]++;
                break;
            } else if (board[neighborRow][neighborCol] == 'B') {
                break;
            } else {
                neighborRow--;
            }
        }
    }

    private void extracted1(char[][] board, int m, int[] count, int neighborRow, int neighborCol) {
        while (neighborRow < m) {
            if (board[neighborRow][neighborCol] == 'p') {
                count[0]++;
                break;
            } else if (board[neighborRow][neighborCol] == 'B') {
                break;
            } else {
                neighborRow++;
            }
        }
    }
}