LeetCode - 999 - 车的可用捕货量（available-captures-for-rook）

JavaScriptLiang

于 2020-03-03 07:44:19 发布

阅读量103

点赞数

本文链接：https://blog.csdn.net/weixin_41806099/article/details/104628683

版权

一目录

不折腾的前端，和咸鱼有什么区别

目录
一目录
二前言
三解题及测试
四 LeetCode Submit
五解题思路

二前言

难度：简单
涉及知识：数组
题目地址：https://leetcode-cn.com/problems/available-captures-for-rook/
题目内容：

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

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

三解题及测试

小伙伴可以先自己在本地尝试解题，再回来看看 jsliang 的解题思路。

LeetCode 给定函数体：

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

根据上面的已知函数，尝试破解本题吧~

确定了自己的答案再看下面代码哈~

index.js

/**
 * @name 车的可用捕获量
 * @param {character[][]} board
 * @return {number}
 */
const numRookCaptures = (board) => {
  // 1. 找到车的位置
  let RPoint = [];
  for (let i = 0; i < board.length; i++) {
    for (let j = 0; j < board[i].length; j++) {
      if (board[i][j] === 'R') {
        RPoint = [i, j];
      }
    }
  }
  // 2. 统计次数
  let time = 0;
  // 2.1 往上走
  for (let j = RPoint[1]; j >= 0; j--) {
    if (board[RPoint[0]][j] === 'B') {
      break;
    }
    if (board[RPoint[0]][j] === 'p') {
      time ++;
      break;
    }
  }
  // 2.2 往下走
  for (let j = RPoint[1]; j < 8; j++) {
    if (board[RPoint[0]][j] === 'B') {
      break;
    }
    if (board[RPoint[0]][j] === 'p') {
      time ++;
      break;
    }
  }
  // 2.3 往左走
  for (let i = RPoint[0]; i >= 0; i--) {
    if (board[i][RPoint[1]] === 'B') {
      break;
    }
    if (board[i][RPoint[1]] === 'p') {
      time ++;
      break;
    }
  }
  // 2.4 往右走
  for (let i = RPoint[0]; i < 8; i++) {
    if (board[i][RPoint[1]] === 'B') {
      break;
    }
    if (board[i][RPoint[1]] === 'p') {
      time ++;
      break;
    }
  }
  return time;
};

console.log(numRookCaptures(
  [
    [".",".",".",".",".",".",".","."],
    [".",".",".","p",".",".",".","."],
    [".",".",".","R",".",".",".","p"],
    [".",".",".",".",".",".",".","."],
    [".",".",".",".",".",".",".","."],
    [".",".",".","p",".",".",".","."],
    [".",".",".",".",".",".",".","."],
    [".",".",".",".",".",".",".","."],
  ]
)); // 3

console.log(numRookCaptures(
  [
    [".",".",".",".",".",".",".","."],
    [".","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

console.log(numRookCaptures(
  [
    [".",".",".",".",".",".",".","."],
    [".",".",".","p",".",".",".","."],
    [".",".",".","p",".",".",".","."],
    ["p","p",".","R",".","p","B","."],
    [".",".",".",".",".",".",".","."],
    [".",".",".","B",".",".",".","."],
    [".",".",".","p",".",".",".","."],
    [".",".",".",".",".",".",".","."],
  ]
)); // 3

node index.js 返回：

3
0
3

四 LeetCode Submit

Accepted
* 22/22 cases passed (88 ms)
* Your runtime beats 11.43 % of javascript submissions
* Your memory usage beats 72.34 % of javascript submissions (33.7 MB)

五解题思路

贵圈真乱，我要捋捋：

车 - R
空白 - .
象 - B
小兵 - p

大写表示自家人，小写表示敌方

然后，没下过国际象棋，所以稍微理解了下：

车能捕获所有在同一横排或者同一纵排的所有兵

不知道是不是除了兵外还可以捕获皇后之类的

简单来说，神挡杀神，佛挡杀佛，狠起来连队友也杀……enm...这道题不行。

【关键点 1】车可以捕获所有同一横排或者统一纵排的兵，但是碰到自己队友拦路，就行不通了。

就好比曹操败走华容道，关羽挡住了，你总不能把关羽先干掉再杀向曹操吧~

【关键点 2】还有就是，一次只能捕获一个：

兵1 兵2 车 兵3 兵4

就好比这样，只能捕获兵2 和兵3。

废话那么多，开始破解：

暴力破解

const numRookCaptures = (board) => {
  // 1. 找到车的位置
  let RPoint = [];
  for (let i = 0; i < board.length; i++) {
    for (let j = 0; j < board[i].length; j++) {
      if (board[i][j] === 'R') {
        RPoint = [i, j];
      }
    }
  }
  // 2. 统计次数
  let time = 0;
  // 2.1 往上走
  for (let j = RPoint[1]; j >= 0; j--) {
    if (board[RPoint[0]][j] === 'B') {
      break;
    }
    if (board[RPoint[0]][j] === 'p') {
      time ++;
      break;
    }
  }
  // 2.2 往下走
  for (let j = RPoint[1]; j < 8; j++) {
    if (board[RPoint[0]][j] === 'B') {
      break;
    }
    if (board[RPoint[0]][j] === 'p') {
      time ++;
      break;
    }
  }
  // 2.3 往左走
  for (let i = RPoint[0]; i >= 0; i--) {
    if (board[i][RPoint[1]] === 'B') {
      break;
    }
    if (board[i][RPoint[1]] === 'p') {
      time ++;
      break;
    }
  }
  // 2.4 往右走
  for (let i = RPoint[0]; i < 8; i++) {
    if (board[i][RPoint[1]] === 'B') {
      break;
    }
    if (board[i][RPoint[1]] === 'p') {
      time ++;
      break;
    }
  }
  return time;
};

这应该是比较暴力的一种方法了，我不管你什么规则，只要在我暴力破解涉及的范围内，我都可以搞出来~

篇幅限制，这里就不翻看题解区和评论区了。

如果小伙伴们有更好的思路想法，欢迎评论留言或者私聊 jsliang~

不折腾的前端，和咸鱼有什么区别！

jsliang 会每天更新一道 LeetCode 题解，从而帮助小伙伴们夯实原生 JS 基础，了解与学习算法与数据结构。

浪子神剑 会每天更新面试题，以面试题为驱动来带动大家学习，坚持每天学习与思考，每天进步一点！

扫描上方二维码，关注 jsliang 的公众号（左）和 浪子神剑 的公众号（右），让我们一起折腾！

jsliang 的文档库由梁峻荣采用知识共享署名-非商业性使用-相同方式共享 4.0 国际许可协议进行许可。
基于https://github.com/LiangJunrong/document-library上的作品创作。
本许可协议授权之外的使用权限可以从 https://creativecommons.org/licenses/by-nc-sa/2.5/cn/ 处获得。

JavaScriptLiang

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
LeetCode - 999 - 车的可用捕货量（available-captures-for-rook）

一目录不折腾的前端，和咸鱼有什么区别目录一目录二前言三解题及测试四 LeetCode Submit五解题思路二前言难度：简单涉及知识：数组题目地址：https://lee...
复制链接

扫一扫