cpp 解法, 执行用时: 0 ms, 内存消耗: 8.9 MB, 提交时间: 2024-12-06 07:25:18

class Solution {
    static constexpr int DIRS[4][2] = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};
public:
    int numRookCaptures(vector<vector<char>>& board) {
        const int SIZE = 8;
        int x0, y0;
        for (int i = 0; i < SIZE; i++) {
            for (int j = 0; j < SIZE; j++) {
                if (board[i][j] == 'R') {
                    x0 = i;
                    y0 = j;
                }
            }
        }
        int ans = 0;
        for (auto& [dx, dy] : DIRS) {
            int x = x0 + dx, y = y0 + dy;
            while (0 <= x && x < SIZE && 0 <= y && y < SIZE && board[x][y] == '.') {
                x += dx;
                y += dy;
            }
            if (0 <= x && x < SIZE && 0 <= y && y < SIZE && board[x][y] == 'p') {
                ans++;
            }
        }
        return ans;
    }
};

java 解法, 执行用时: 0 ms, 内存消耗: 40.1 MB, 提交时间: 2024-12-06 07:25:05

class Solution {
    private static final int[][] DIRS = {{0, -1}, {0, 1}, {-1, 0}, {1, 0}};

    public int numRookCaptures(char[][] board) {
        final int SIZE = 8;
        int x0 = 0;
        int y0 = 0;
        for (int i = 0; i < SIZE; i++) {
            for (int j = 0; j < SIZE; j++) {
                if (board[i][j] == 'R') {
                    x0 = i;
                    y0 = j;
                }
            }
        }
        int ans = 0;
        for (int[] d : DIRS) {
            int x = x0 + d[0];
            int y = y0 + d[1];
            while (0 <= x && x < SIZE && 0 <= y && y < SIZE && board[x][y] == '.') {
                x += d[0];
                y += d[1];
            }
            if (0 <= x && x < SIZE && 0 <= y && y < SIZE && board[x][y] == 'p') {
                ans++;
            }
        }
        return ans;
    }
}

golang 解法, 执行用时: 0 ms, 内存消耗: 3.8 MB, 提交时间: 2024-12-06 07:24:48

var dirs = []struct{ x, y int }{{0, -1}, {0, 1}, {-1, 0}, {1, 0}}

func numRookCaptures(board [][]byte) (ans int) {
    const size = 8
    var x0, y0 int
    for i, row := range board {
        for j, c := range row {
            if c == 'R' {
                x0, y0 = i, j
            }
        }
    }
    for _, d := range dirs {
        x, y := x0+d.x, y0+d.y
        for 0 <= x && x < size && 0 <= y && y < size && board[x][y] == '.' {
            x += d.x
            y += d.y
        }
        if 0 <= x && x < size && 0 <= y && y < size && board[x][y] == 'p' {
            ans++
        }
    }
    return
}

python3 解法, 执行用时: 0 ms, 内存消耗: 17 MB, 提交时间: 2024-12-06 07:24:16

class Solution:
    def numRookCaptures(self, board: List[List[str]]) -> int:
        SIZE = 8
        for i, row in enumerate(board):
            for j, c in enumerate(row):
                if c == 'R':
                    x0, y0 = i, j
        ans = 0
        for dx, dy in (0, -1), (0, 1), (-1, 0), (1, 0):
            x, y = x0 + dx, y0 + dy
            while 0 <= x < SIZE and 0 <= y < SIZE and board[x][y] == '.':
                x += dx
                y += dy
            if 0 <= x < SIZE and 0 <= y < SIZE and board[x][y] == 'p':
                ans += 1
        return ans

golang 解法, 执行用时: 0 ms, 内存消耗: 1.9 MB, 提交时间: 2021-06-12 00:18:07

func numRookCaptures(board [][]byte) (cnt int) {
    ri, rj := 0, 0
    for i := 0; i < 8; i++ {
        for j := 0; j < 8; j++ {
            if board[i][j] == 'R' {
                ri, rj = i, j
                break
            }
        }
    }

    tx, ty := 0, 0
    // x轴,y轴
    dx, dy := [4]int{0, 1, 0, -1}, [4]int{1, 0, -1, 0}
    for i := 0; i < 4; i++ {
        for step := 0; ; step++ {
            tx = ri + step * dx[i];
            ty = rj + step * dy[i];
            if tx < 0 || tx >= 8 || ty < 0 || ty >= 8 || board[tx][ty] == 'B' {
                break
            }
            
            if board[tx][ty] == 'p' {
                cnt++
                break
            }
        }
    }

    return cnt
}