Leetcode 车的可用捕获量

最新推荐文章于 2020-03-26 22:18:23 发布

JOJO___

最新推荐文章于 2020-03-26 22:18:23 发布

阅读量167

点赞数

分类专栏： Leetcode 文章标签： Leetcode c 车的可用捕获量

本文链接：https://blog.csdn.net/a827143452/article/details/89913659

版权

Leetcode 专栏收录该内容

118 篇文章 1 订阅

订阅专栏

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

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

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

示例 1：

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

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

示例 3：

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

提示：

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

思路: 先找R, 再沿四个方向找p。

int numRookCaptures(char** board, int boardSize, int* boardColSize){
    int i, j;
    int x,y;
    int count=0;
    
    for(i = 0; i < boardSize; i++)
         for(j = 0; j< *boardColSize; j++)
             if(board[i][j] == 'R')
                 goto end;
             
    
end:
    x = i;
    y = j;
    
    while(x < boardSize){
        if(board[x][y] == 'p') {
            count++;
            break;
        } else if (board[x][y] == 'B'){
            break;
        }
        x++;
    }
    
    x = i;
    
    
    while(x >= 0){
        if(board[x][y] == 'p') {
            count++;
            break;
        } else if (board[x][y] == 'B'){
            break;
        }
        x--;
    }
    
    
    x = i;
    
    while(y < *boardColSize) {
        if(board[x][y] == 'p'){
            count++;
            break;
        } else if (board[x][y] == 'B'){
            break;
        }
        y++;
    }
    
    y = j;
    
    while(y >= 0){
        if(board[x][y] == 'p') {
            count++;
            break;
        } else if (board[x][y] == 'B'){
            break;
        }
        y--;
    }
    
    return count;
}