leetcode解题之车的可用捕获量

在一个 8 x 8 的棋盘上，有一个白色的车（Rook），用字符 ‘R’
表示。棋盘上还可能存在空方块，白色的象（Bishop）以及黑色的卒（pawn），分别用字符 ‘.’，‘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 的卒。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/available-captures-for-rook
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

要充分的理解题意，白车®只能直线行动切不可转向，遇到黑卒§即停

class Solution {
    public int numRookCaptures(char[][] board) {
        int ans = 0;
        for(int i=0;i<8;i++){
            boolean flag = false;
            for(int j=0;j<8;j++){
                if(board[i][j]=='R'){
                 ans+=leftHasPawn(board,i,j-1);
                 ans+=upHasPawn(board,i-1,j);
                 ans+=rightHasPawn(board,i,j+1);
                 ans+=downHasPawn(board,i+1,j);
                 return ans;//return 可以跳出多重循环
                }
            }
        }
        return ans;
    }
    //获取左侧是否存在可吃的卒
    private int leftHasPawn(char[][] board,int i,int j){
        for(;j>=0;j--){
            if(board[i][j]=='p'){
                return 1;
            }else if(board[i][j]=='B'){
                return 0;
            }
        }
        return 0;
    }
    //获取上方是否存在可吃的卒
    private int upHasPawn(char[][] board,int i,int j){
        for(;i>=0;i--){
            if(board[i][j]=='p'){
                return 1;
            }else if(board[i][j]=='B'){
                return 0;
            }
        }
        return 0;
    }
    //获取右侧是否存在可吃的卒
    private int rightHasPawn(char[][] board,int i,int j){
        for(;j<8;j++){
            if(board[i][j]=='p'){
                return 1;
            }else if(board[i][j]=='B'){
                return 0;
            }
        }
        return 0;
    }
    //获取下方是否存在可吃的卒
    private int downHasPawn(char[][] board,int i,int j){
        for(;i<8;i++){
            if(board[i][j]=='p'){
                return 1;
            }else if(board[i][j]=='B'){
                return 0;
            }
        }
        return 0;
    }
}

优化一下

class Solution {
    public int numRookCaptures(char[][] board) {
        //定义上下左右四个方向
        int[] dx = {-1,1,0,0};
        int[] dy = {0,0,-1,1};
        int ans = 0;
        for(int i=0;i<8;i++){
            for(int j=0;j<8;j++){
                if(board[i][j]=='R'){
                    for(int m=0;m<4;m++){
                        int x=i,y=j;
                        while(x>=0&&y>=0&&x<8&&y<8&&board[x][y]!='B'){
                        // if(x<0||y<0||x>=8||y>=8||board[x][y]=='B') break;
                        if(board[x][y]=='p'){
                                ans++;
                                break;
                            }
                            x+=dx[m];
                            y+=dy[m];
                        }  
                    } 
                 return ans;//return 可以跳出多重循环
                }
            }
        }
        return ans;
    }
   
}