在一个 8 x 8 的棋盘上，有一个白色车（rook）。也可能有空方块，白色的象（bishop）和黑色的卒（pawn）。它们分别以字符 “R”，“.”，“B” 和 “p” 给出。大写字符表示白棋，小写字符表示黑棋。
车按国际象棋中的规则移动：它选择四个基本方向中的一个（北，东，西和南），然后朝那个方向移动，直到它选择停止、到达棋盘的边缘或移动到同一方格来捕获该方格上颜色相反的卒。另外，车不能与其他友方（白色）象进入同一个方格。
返回车能够在一次移动中捕获到的卒的数量。
题解：
1.8 x 8 的棋盘，只有一个白色车(R)，其它有空方块(.)，白色象(B)，黑色卒(p)
2.棋盘里大写字符表示白棋，小写字符表示黑棋
3.车的移动规则：
-
北，东，西和南四个方向中一个
-
动作或停止，或到棋盘边缘，或捕获颜色相反的卒
-
不与白色象同方格
示例 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在棋盘中的位置，找到后就停止查找
-
以车R所在的下标，上下左右，遍历所在的行列
-
注意判断如果先卒遍历到象则不能计数
C/C++题解：
class Solution {
public:
int pnum=0;//记录能捕获的卒的数量
int numRookCaptures(vector<vector<char>>& board) {
for(int i=0;i<board.size();i++){
for(int j=0;j<board[i].size();j++){
if(board[i][j]=='R'){//遍历找车的位置
pnum += getPawn(board,i,j,0,1,'p','B');//向上找卒
pnum += getPawn(board,i,j,0,-1,'p','B');//向下找卒
pnum += getPawn(board,i,j,1,0,'p','B');//向右找卒
pnum += getPawn(board,i,j,-1,0,'p','B');//向左找卒
return pnum;}}}
return 0;}
int getPawn(vector<vector<char>>& board,int x,int y,int dx,int dy,char ch,char ansCh){
while(x>=0 && x<board.size() && y>=0 && y<board[x].size() && board[x][y]!=ansCh){
if(board[x][y]==ch) return 1;//在找卒过程中没找到过象再计数
x+=dx;//在x原方向上找下一格
y+=dy;}//与x确定原方向上的下一格
return 0;}};
Debug结果：
Java题解：
class Solution {
public int pnum;//记录能捕获的卒的数量
public int numRookCaptures(char[][] board) {
for(int i=0;i<board.length;i++){
for(int j=0;j<board[i].length;j++){
if(board[i][j]=='R'){//遍历找车的位置
pnum += getPawn(board,i,j,0,1,'p','B');//向上找卒,不遇象
pnum += getPawn(board,i,j,0,-1,'p','B');//向下找卒,不遇象
pnum += getPawn(board,i,j,1,0,'p','B');//向右找卒,不遇象
pnum += getPawn(board,i,j,-1,0,'p','B');//向左找卒,不遇象
return pnum;}}}
return 0;}
public int getPawn(char[][] board,int x,int y,int dx,int dy,char ch,char ansCh){
while(x>=0 && x<board.length && y>=0 && y<board[x].length && board[x][y]!=ansCh){
if(board[x][y]==ch) return 1;//在找卒过程中没找到过象再计数
x+=dx;//在x原方向上找下一格
y+=dy;}//与x确定原方向上的下一格
return 0;}}
Debug结果：
Python题解：
class Solution(object):
def numRookCaptures(self, board):
""":type board: List[List[str]]:rtype: int"""
def getPawn(board, x, y,dx, dy, ch, ansCh):
while(x>=0 and x<len(board) and y>=0 and y<len(board[x]) and board[x][y]!=ansCh):
if board[x][y]==ch:#在找卒过程中没找到过象再计数
return 1;
x+=dx#在x原方向上找下一格
y+=dy#与x确定原方向上的下一格
return 0
pnum=0 #记录能捕获的卒的数量
for i in range(len(board)):
for j in range(len(board[i])):
if board[i][j]=='R':#遍历找车的位置
pnum += getPawn(board,i,j,0,1,'p','B')#向上找卒,不遇象
pnum += getPawn(board,i,j,0,-1,'p','B')#向下找卒,不遇象
pnum += getPawn(board,i,j,1,0,'p','B')#向右找卒,不遇象
pnum += getPawn(board,i,j,-1,0,'p','B')#向左找卒,不遇象
return pnum
return 0
Debug结果：
例题来自力扣网https://leetcode-cn.com/
更多题解前往公众号获取
768
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
