leetcode 算法题999 (简单262) 车的可用捕获量
- 题目介绍
在一个 8 x 8 的棋盘上,有一个白色车(rook)。
也可能有空方块,白色的象(bishop)和黑色的卒(pawn)。
它们分别以字符 “R”,“.”,“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 的卒。
- 提示
board.length == board[i].length == 8
board[i][j] 可以是 ‘R’,’.’,‘B’ 或 ‘p’
只有一个格子上存在 board[i][j] == ‘R’
- 解法一
/**
* @param {character[][]} board
* @return {number}
*/
var numRookCaptures = function(board) {
let i = 0;
while(i < board.length) {
let j = 0;
while(j < board[i].length) {
if(board[i][j] === 'R') {
return getRookNum(board, i, j);
}
j++;
}
i++;
}
return 0;
};
const getRookNum = (board, i, j) => {
let count = 0, left = i - 1, right = i + 1, top = j - 1, bottom = j + 1;
while(left >= 0) {
if(board[left][j] === '.') {
left--;
} else if(board[left][j] === 'B') {
break;
} else if(board[left][j] === 'p') {
count++;
break;
}
}
while(right < board.length) {
if(board[right][j] === '.') {
right++;
} else if(board[right][j] === 'B') {
break;
} else if(board[right][j] === 'p') {
count++;
break;
}
}
while(top >= 0) {
if(board[i][top] === '.') {
top--;
} else if(board[i][top] === 'B') {
break;
} else if(board[i][top] === 'p') {
count++;
break;
}
}
while(bottom < board[i].length) {
if(board[i][bottom] === '.') {
bottom++;
} else if(board[i][bottom] === 'B') {
break;
} else if(board[i][bottom] === 'p') {
count++;
break;
}
}
return count;
}
执行用时 : 56 ms, 在所有 JavaScript 提交中击败了98.65%的用户
内存消耗 : 33.7 MB, 在所有 JavaScript 提交中击败了32.73%的用户