LeetCode（999）——车的可用捕获量（JavaScript）

在一个 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'

/*** @param {character[][]} board* @return {number}*/
var numRookCaptures = function(board) {};

个人解法

var numRookCaptures = function(board) {var result = 0,index,arr = [],arr2 = [];//示例3//找到车的那一行["p","p",".","R",".","p","B","."]for(var i = 0; i < board.length; i++){if(board[i].indexOf("R") > -1){index =  board[i].indexOf("R");arr.push(board[i]);break;}}//找到车的那一列[".","p","p","R",".","B","p","."]for(var i = 0; i < board.length; i++){arr2.push(board[i][index]);}arr.push(arr2);//去掉.for(var i = 0; i < arr.length; i++){//arr[i].join("").split(".") => ["p","p",".","R",".","p","B","."]for(var j = 0; j < arr[i].length; j++){if(arr[i][j] === '.'){arr[i].splice(j,1);j--;}}if(arr[i][arr[i].indexOf("R") - 1] === "p"){result ++;}if(arr[i][arr[i].indexOf("R") + 1] === "p"){result ++;}}return result;
};

LeetCode（999）——车的可用捕获量（JavaScript）相关推荐

LeetCode:999. 车的可用捕获量
999. 车的可用捕获量题目: 解题思路: 源码: 踩坑点: 题目: 解题思路: 其实很简单,先找到车的位置,在扫描车所在的行和列判断即可源码: int numRookCaptures(char* ...
LeetCode 999. 车的可用捕获量
1. 题目在一个 8 x 8 的棋盘上,有一个白色车(rook).也可能有空方块,白色的象(bishop)和黑色的卒(pawn).它们分别以字符 "R","." ...
【LeetCode】999. 车的可用捕获量
题目链接: 999. 车的可用捕获量题目描述: 在一个 8 x 8 的棋盘上,有一个白色车(rook).也可能有空方块,白色的象(bishop)和黑色的卒(pawn).它们分别以字符 "R ...
每日一题，每日一练。11车的可用捕获量（半夜两点在棋盘上左右横跳），
在一个 8 x 8 的棋盘上,有一个白色车(rook).也可能有空方块,白色的象(bishop)和黑色的卒(pawn).它们分别以字符 "R",".",&quo ...
python【力扣LeetCode算法题库】999-车的可用捕获量（DFS）
车的可用捕获量在一个 8 x 8 的棋盘上,有一个白色车(rook).也可能有空方块,白色的象(bishop)和黑色的卒(pawn).它们分别以字符 "R",".&qu ...
LeetCode ----车的可捕获量（JavaScript解法）
一.题目描述 #### 二.实例三.解题思路我们可以用两层循环来对它进行遍历,当遇到R时记录它的横纵坐标再对四个方向依次进行一个遍历,当遇到B时直接break,当遇到p时num++,再break ...
LeetCode第一题两数之和---JavaScript
给定一个整数数组 nums 和一个整数目标值 target,请你在该数组中找出和为目标值 target 的那两个整数,并返回它们的数组下标. 你可以假设每种输入只会对应一个答案.但是,数组中同一 ...
LeetCode 695. Max Area of Island javascript解决方案
题意: 寻找最大岛. leetcode.com/problems/ma- 传入: [[0,0,1,0,0,0,0,1,0,0,0,0,0], [0,0,0,0,0,0,0,1,1,1,0,0,0], ...
leetcode 5 Longest Palindromic Substring Java JavaScript解法
题目详情 Given a string s, find the longest palindromic substring in s. You may assume that the maximum ...

LeetCode（999）——车的可用捕获量（JavaScript）

个人解法

LeetCode（999）——车的可用捕获量（JavaScript）相关推荐

最新文章

热门文章