车的可用捕获量---JS

来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/available-captures-for-rook
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。

每日一题,这道题挺简单的,但是一下子就能想到动行不动列,动列不动行,从中心往四个方向查找,但是当我在一个函数里去做操作的时候,运行超出时间限制。看了下题解和别人的写法,然后用JS写法来了,核心函数自己写没写好所以还是选择用题解给出的方案,走你

在一个 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'
var numRookCaptures = function(board) {
   let arr = getR(board).split('')
   let Rrow = +arr[0]
   let Rcol = +arr[1]
   return getp(board,Rrow,Rcol,-1,0) + getp(board,Rrow,Rcol,1,0) + getp(board,Rrow,Rcol,0,-1) + getp(board,Rrow,Rcol,0,1)
};
function getp (arr,row,col,x,y) {
   while (row >= 0 && row < arr.length && col >= 0 && col < arr[row].length && arr[row][col] !== 'B') {
       if (arr[row][col] === 'p'){
           return 1
       }
       row+=x
       col+=y
   }
   return 0
}
function getR (board) {
   let Rrow = 0
   let Rcol = 0
   for(let i = 0; i < 8; i++) {
       for(let j = 0; j < 8; j++) {
           if ('R' === board[i][j]) {
               Rrow = i
               Rcol = j
           }
       }
   }
   return Rrow + '' + Rcol 
}
基于STM32F407,使用DFS算法实现最短迷宫路径检索,分为三种模式:1.DEBUG模式,2. 训练模式,3. 主程序模式 ,DEBUG模式主要分析bug,测量必要数据,训练模式用于DFS算法训练最短路径,并将最短路径以链表形式存储Flash, 主程序模式从Flash中….zip项目工程资源经过严格测试可直接运行成功且功能正常的情况才上传,可轻松复刻,拿到资料包后可轻松复现出一样的项目,本人系统开发经验充足(全领域),有任何使用问题欢迎随时与我联系,我会及时为您解惑,提供帮助。 【资源内容】:包含完整源码+工程文件+说明(如有)等。答辩评审平均分达到96分,放心下载使用!可轻松复现,设计报告也可借鉴此项目,该资源内项目代码都经过测试运行成功,功能ok的情况下才上传的。 【提供帮助】:有任何使用问题欢迎随时与我联系,我会及时解答解惑,提供帮助 【附带帮助】:若还需要相关开发工具、学习资料等,我会提供帮助,提供资料,鼓励学习进步 【项目价值】:可用在相关项目设计中,皆可应用在项目、毕业设计、课程设计、期末/期中/大作业、工程实训、大创等学科竞赛比赛、初期项目立项、学习/练手等方面,可借鉴此优质项目实现复刻,设计报告也可借鉴此项目,也可基于此项目来扩展开发出更多功能 下载后请首先打开README文件(如有),项目工程可直接复现复刻,如果基础还行,也可在此程序基础上进行修改,以实现其它功能。供开源学习/技术交流/学习参考,勿用于商业用途。质量优质,放心下载使用。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值