菜鸟Leetcode-Day5-999. 可以被一步捕获的棋子数

本文链接：https://blog.csdn.net/wield_jjz/article/details/105493010

999. 可以被一步捕获的棋子数

题目

难度：简单

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

思路

从东西南北四个方向遍历

代码

class Solution {
public:
    int numRookCaptures(vector<vector<char>>& board) {
        //遍历东南西北四个方向
        int i, j, hang, lie, count = 0;
        //找到R所在的行列数
        for(i = 0; i < 8; i++){
            for(j = 0; j < 8; j++){
                if(board[i][j] == 'R'){
                    hang = i;
                    lie = j;
                }
            }
        }
        //向东遍历->列数变大
        for(int k = lie; k < 8; k++){
            if(board[hang][k] == '.'){
                continue;
            }
            else if(board[hang][k] == 'B'){
                break;
            }
            else if(board[hang][k] == 'p'){
                count++;
                break;
            }
        }
        //向西遍历<-列数变小
        for(int k = lie; k >= 0; k--){
            if(board[hang][k] == '.'){
                continue;
            }
            else if(board[hang][k] == 'B'){
                break;
            }
            else if(board[hang][k] == 'p'){
                count++;
                break;
            }
        }
        //向南遍历，行数变大
        for(int k = hang; k < 8; k++){
            if(board[k][lie] == '.'){
                continue;
            }
            else if(board[k][lie] == 'B'){
                break;
            }
            else if(board[k][lie] == 'p'){
                count++;
                break;
            }
        }
        //向北遍历，行数变小
        for(int k = hang; k >= 0; k--){
            if(board[k][lie] == '.'){
                continue;
            }
            else if(board[k][lie] == 'B'){
                break;
            }
            else if(board[k][lie] == 'p'){
                count++;
                break;
            }
        }

        return count;

    }
};