LeetCode—— 999 车的可用捕获量

问题描述

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

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

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

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

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

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

提示：

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
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

执行结果

代码描述

思路：暴利求解，先扫描找到车，然后上下左右确定是不是第一个可达到的是卒。只要没有象拦着，就可以了。

class Solution {
public:
    int numRookCaptures(vector<vector<char>>& board) {
        int count = 0;
        int x = 0, y = 0;
        // 查找车的位置
        for(int i = 0; i < 8; ++i)
        {
            for(int j = 0; j < 8; ++j)
            {
                if(board[i][j] == 'R')
                {
                    x = i;
                    y = j;
                }
            }
        }
        // 向下走
        for(int i = x; i < 8; ++i)
        {
            if(board[i][y] == 'p')
            {
                count += 1;
                break;
            }
            else if(board[i][y] == 'B')
                break;
        }
        // 向上走
        for(int i = x; i >= 0; --i)
        {
            if(board[i][y] == 'p')
            {
                count += 1;
                break;
            }
            else if(board[i][y] == 'B')
                break;
        }
        // 向左走
        for(int j = y; j >= 0; --j)
        {
            if(board[x][j] == 'p')
            {
                count += 1;
                break;
            }
            else if(board[x][j] == 'B')
                break;
        }
        // 向右走
        for(int j = y; j < 8; ++j)
        {
            if(board[x][j] == 'p')
            {
                count += 1;
                break;
            }
            else if(board[x][j] == 'B')
                break;
        }
        return count;
    }
};