(Leetcode题解)999. 可以被一步捕获的棋子数--含题目详细描述、具体题解、详细代码注释

(Leetcode)题目描述：999. 可以被一步捕获的棋子数

类型：模拟

在一个 8 x 8 的棋盘上，有一个白色的车（Rook），用字符 'R' 表示。棋盘上还可能存在空方块，白色的象（Bishop）以及黑色的卒（pawn），分别用字符 '.'，'B' 和 'p' 表示。不难看出，大写字符表示的是白棋，小写字符表示的是黑棋。

车按国际象棋中的规则移动。东，西，南，北四个基本方向任选其一，然后一直向选定的方向移动，直到满足下列四个条件之一：

• 棋手选择主动停下来。
• 棋子因到达棋盘的边缘而停下。
• 棋子移动到某一方格来捕获位于该方格上敌方（黑色）的卒，停在该方格内。
• 车不能进入/越过已经放有其他友方棋子（白色的象）的方格，停在友方棋子前。

你现在可以控制车移动一次，请你统计有多少敌方的卒处于你的捕获范围内（即，可以被一步捕获的棋子数）。

示例 1：

输入：[[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]

输出：3

解释：在本例中，车能够捕获所有的卒。

示例 2：

输入：[[".",".",".",".",".",".",".","."],[".","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 的卒。

提示：

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

解题思路：

(1) 先寻找’R’的位置
(2) 从R的四个方向遍历
(3) 每次遍历保证指针不越界
(4) 遇到除’.'以外的字符跳出循环

详细代码：

class Solution {
public:
    // 函数用于计算可以被一步捕获的棋子数
    int numRookCaptures(vector<vector<char>>& board) {
        int res = 0; // 初始化捕获的棋子数为0
        int x, y; // 用于存储'R'的坐标

        // (1). 寻找'R'的位置
        for(int i = 0; i < 8; i++) {
            for(int j = 0; j < 8; j++) {
                if(board[i][j] == 'R') {
                    x = i; // 记录'R'的x坐标
                    y = j; // 记录'R'的y坐标
                    // 找到'R'后，退出内层循环
                    break;
                }
            }
            // 如果找到'R'，退出外层循环
            if(x != 0 && y != 0) break;
        }

        // (2). 从'R'的四个方向（上、下、左、右）遍历
        // 向上遍历
        int dy = y - 1;
        while(dy >= 0 && board[x][dy] == '.') {
            dy--; // 指针不越界且遇到的是空格，继续向上移动
        }
        // (3). 遇到除'.'以外的字符，如果是'p'，即为可捕获的棋子
        if(dy >= 0 && board[x][dy] == 'p') {
            res++; // 增加捕获的棋子数
        }

        // 向下遍历
        dy = y + 1;
        while(dy < 8 && board[x][dy] == '.') {
            dy++; // 同上，但是方向向下
        }
        if(dy < 8 && board[x][dy] == 'p') {
            res++;
        }

        // 向右遍历
        int dx = x + 1;
        while(dx < 8 && board[dx][y] == '.') {
            dx++; // 同上，但是方向向右
        }
        if(dx < 8 && board[dx][y] == 'p') {
            res++;
        }

        // 向左遍历
        dx = x - 1;
        while(dx >= 0 && board[dx][y] == '.') {
            dx--; // 同上，但是方向向左
        }
        if(dx >= 0 && board[dx][y] == 'p') {
            res++;
        }

        // 返回可以捕获的棋子总数
        return res;      
    }
};