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-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
The newest version!
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%)

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