【Leetcode】999. 车能够吃子的数量（Available Captures for Rook）

Leetocde - 999 Available Captures for Rook (Easy)

题目描述：在一个8 × 8的棋盘上，有一个白色车（rook），也可能有空方块，白色的象（bishop）和黑色的卒（pawn）。它们分别以字符R，.，B和p给出。大写字符表示白棋，小写字符表示黑棋。
车按国际象棋中的规则移动：它选择四个基本方向中的一个（北，东，西和南），然后朝那个方向移动，直到它选择停止、到达棋盘的边缘或移动到同一方格上颜色相反的卒。另外，车不能与其他友方（白色）象进入同一个方格。返回车能够在一次移动中捕获到的卒的数量。

[[".",".",".",".",".",".",".","."],
 [".",".",".","p",".",".",".","."],
 [".",".",".","R",".",".",".","p"],
 [".",".",".",".",".",".",".","."],
 [".",".",".",".",".",".",".","."],
 [".",".",".","p",".",".",".","."],
 [".",".",".",".",".",".",".","."],
 [".",".",".",".",".",".",".","."]]

解题思路：题目不难，主要学习一下代码的思想，如何精简代码。

public int numRookCaptures(char[][] b) {
    for (int i = 0; i < b.length; ++i)
        for (int j = 0; j < b[i].length; ++j)
            if (b[i][j] == 'R') return cap(b,i,j,0,1)+cap(b,i,j,0,-1)+cap(b,i,j,1,0)+cap(b,i,j,-1,0);
    return 0;
}
int cap(char[][] b, int x, int y, int dx, int dy) {
    while (x >= 0 && x < b.length && y >= 0 && y < b[x].length && b[x][y] != 'B') {
        if (b[x][y] == 'p') return 1;
        x += dx; y += dy;
    }
    return 0;
}