leetcode-每日一题-车的可用捕获量

话说最近的每日一题都有点像阅读理解???

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

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

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

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

一开始读了几遍题硬是没看懂什么意思,之后发现就是上下左右位移找p,在一个方位找到p后,换个方位再找。

class Solution {
public:
    int sum = 0;
    int numRookCaptures(vector<vector<char>>& board) {
        int dx[4]={1,0,-1,0};
        int dy[4]={0,1,0,-1};
        int x,y;
        for(int i=0;i<board.size();i++){
            for(int j=0;j<board[i].size();j++){
                if(board[i][j]=='R'){
                    for(int k=0;k<4;k++){
                        x=i,y=j;
                        while(true){
                            x=x+dx[k];
                            y=y+dy[k];
                            if(x>=8||x<0||y<0||y>=8||board[x][y]=='B')                          break;
                            if(board[x][y]=='p'){
                                sum++;
                                break;
                            }
                        }
                    }
                }
            }
        }
        return sum;
    }
};

 

发布了28 篇原创文章 · 获赞 1 · 访问量 969
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 1024 设计师: 上身试试

分享到微信朋友圈

×

扫一扫,手机浏览