LeetCode——999.车的可用捕获量

在一个 8 x 8 的棋盘上，有一个白色车（rook）。也可能有空方块，白色的象（bishop）和黑色的卒（pawn）。它们分别以字符 “R”，“.”，“B” 和 “p” 给出。大写字符表示白棋，小写字符表示黑棋。

车按国际象棋中的规则移动：它选择四个基本方向中的一个（北，东，西和南），然后朝那个方向移动，直到它选择停止、到达棋盘的边缘或移动到同一方格来捕获该方格上颜色相反的卒。另外，车不能与其他友方（白色）象进入同一个方格。

返回车能够在一次移动中捕获到的卒的数量。

示例 1：

输入：[[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
输出：3
解释：
在本例中，车能够捕获所有的卒。

示例 2：

输入：[[".",".",".",".",".",".",".","."],[".","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",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
输出：0
解释：
象阻止了车捕获任何卒。

示例 3：

输入：[[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","p",".",".",".","."],["p","p",".","R",".","p","B","."],[".",".",".",".",".",".",".","."],[".",".",".","B",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."]]
输出：3
解释： 
车可以捕获位置 b5，d6 和 f5 的卒。

提示：

board.length == board[i].length == 8
board[i][j] 可以是 'R'，'.'，'B' 或 'p'
只有一个格子上存在 board[i][j] == 'R'

解法：

对棋子停止条件的描述：直到它选择停止、到达棋盘的边缘或移动到同一方格来捕获该方格上颜色相反的卒。提炼出停止条件：

• 选择停止。这里应该是指遇到了与自己同颜色的棋子，即B
• 到达棋盘边缘。这里的棋盘边缘值为8
• 捕获到一个颜色相反的卒。这意味着只要捕获到了一个卒p棋子就会停下，不管后面是否仍有颜色相反的卒。说明能找到卒个数的最大值为4

一次移动：题目中提到的一次行动是指往上下左右四个方向都进行查找一遍的行动称为一次行动。

所以我们只需要先遍历数组，找到棋子R的位置，以它为中心向四个方向寻找就可以了。

class Solution{
	 public int numRookCaptures(char[][] board) {
        //右下左上四个移动方向
        int[][] mov=new int[][]{{0,1},{1,0},{0,-1},{-1,0}};
        //结果
        int res=0;
        //遍历棋盘
        for (int i = 0; i < 8; i++) {
            for (int j = 0; j < 8; j++) {
                if (board[i][j] == 'R') {
                    for(int[] m:mov){
                        if(isFindEnemy(board,i,j,m)){
                            res++;
                        }
                    }
                }
            }
        }
        return res;
    }
    /**
     *  寻找敌人
     * @param board 棋盘数组
     * @param x R所在的行
     * @param y R所在的列
     * @param m 移动的方向
     * @return 是否找到敌人
     */
    private boolean isFindEnemy(char[][] board,int x,int y,int[] m){
        while(isInMap(x,y)){
            if(board[x][y]=='B'){
                break;
            }
            if(board[x][y]=='p'){
                return true;
            }

            x=x+m[0];
            y=y+m[1];
            
        }
        return false;
    }
    /**
     *  是否越界
     * @param x R所在的行
     * @param y R所在的列
     * @return 是否越界
     */
    private boolean isInMap(int x,int y){
        return x>=0&&x<8&&y>=0&&y<8;
    }
}