Leetcode 999 Available Captures for Rook

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/polanwind/article/details/87915280

class Solution {
    public int numRookCaptures(char[][] board) {
        int ans=0;
        int row=board.length;
        int col=board[0].length;
        int locx=0;
        int locy=0;
        for(int i=0;i<row;++i){
            for(int j=0;j<col;++j){
                if((board[i][j]-'R')==0){
                   locx=i;
                   locy=j;
                }
            }
        }
        for(int i=locy+1;i<col;++i){
            if((board[locx][i]-'B')==0){
                break;
            }
            if((board[locx][i]-'p')==0){
                ans++;
                break;
            }
        }
        for(int i=locy-1;i>=0;--i){
            if((board[locx][i]-'B')==0){
                break;
            }
            if((board[locx][i]-'p')==0){
                ans++;
                break;
            }
        }
        for(int i=locx-1;i>=0;--i){
            if((board[i][locy]-'B')==0){
                break;
            }
            if((board[i][locy]-'p')==0){
                ans++;
                break;
            }
        }
        for(int i=locx+1;i<row;++i){
            if((board[i][locy]-'B')==0){
                break;
            }
            if((board[i][locy]-'p')==0){
                ans++;
                break;
            }
        }
        return ans;
    }
}