2019-12-29-LeetCode【999. 车的可用捕获量】

999. 车的可用捕获量

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

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

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

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

示例 1：

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

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

示例 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
解释：
象阻止了车捕获任何卒。

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

示例 3：

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

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

提示：

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

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

思路

先找到车的位置，遍历四个方向，找到四个方向上的所有的'p'。

代码

class Solution {
public:
    int numRookCaptures(vector<vector<char>>& board) {
        //先找到车
        // int R=board.size();
        // int C=board[0].size();
        int R=8;
        int C=8;
        int flag=0;
         int x=0,y=0;//车的位置
        for(int i=0;i<R;i++)
        {
            for(int j=0;j<C;j++)
            {
                if(board[i][j]=='R'){
                     x=i;
                     y=j;//车的位置
                    flag=1;
                    break;
                }
            }
            if(flag==1)
            break;
        }

        // int x=i,y=j;//车的位置
        int res=0;

        //往左
        for(int i=y;i>=0;i--)
        {
            if(board[x][i]=='B') break;
            if(board[x][i]=='p') {res++;break;}
        }
        //往右
            for(int i=y;i<C;i++)
        {
            if(board[x][i]=='B') break;
            if(board[x][i]=='p') {res++;break;}
        }
        //往下
            for(int i=x;i<R;i++)
        {
            if(board[i][y]=='B') break;
            if(board[i][y]=='p') {res++;break;}
        }    
        //往上
            for(int i=x;i>=0;i--)
        {
            if(board[i][y]=='B') break;
             if(board[i][y]=='p') {res++;break;}
        }    


        return res;
        
    }
};