999. 车的可用捕获量
题目
在一个 8 x 8 的棋盘上,有一个白色车(rook)。也可能有空方块,白色的象(bishop)和黑色的卒(pawn)。它们分别以字符 “R”,“.”,“B” 和 “p” 给出。大写字符表示白棋,小写字符表示黑棋。
车按国际象棋中的规则移动:它选择四个基本方向中的一个(北,东,西和南),然后朝那个方向移动,直到它选择停止、到达棋盘的边缘或移动到同一方格来捕获该方格上颜色相反的卒。另外,车不能与其他友方(白色)象进入同一个方格。
返回车能够在一次移动中捕获到的卒的数量。
测试用例
输入:[[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
输出:3
解释:
在本例中,车能够捕获所有的卒。
分析
考察方向数组的问题:
- 暴力法:
四层 for 循环 - 奇思妙解:
通过创建平面坐标系来解决
题解
/**
* @param {character[][]} board
* @return {number}
* 分析:
* 考察方向数组的问题
* 暴力法:
* 四层 for 循环
* 奇思妙解:
* 通过创建平面坐标系来解决
*/
var numRookCaptures = function(board) {
let result=0;
for(let i=0;i<board.length;i++){
for(let j=0;j<board[i].length;j++){
//找到 R 的位置
if(board[i][j]==="R"){
//R 为原点创建坐标系
//向四个方向查找
return rampage(board,i,j,0,1)+rampage(board,i,j,0,-1)+rampage(board,i,j,1,0)+rampage(board,i,j,-1,0);
}
}
}
};
/**
* @param {board:做标数据,x,y: R 的坐标; dx,dy:步长}
*/
var rampage=(board,x,y,dx,dy)=>{
while(x>=0 && x<board.length && y>=0 && y<board[x].length && board[x][y]!=="B"){
if(board[x][y]==="p"){
return 1;
}
x+=dx;
y+=dy;
}
return 0;
}
