【LeetCode】999. 车的可用捕获量
时间:2020-03-26
本文章向大家介绍【LeetCode】999. 车的可用捕获量,主要包括【LeetCode】999. 车的可用捕获量使用实例、应用技巧、基本知识点总结和需要注意事项,具有一定的参考价值,需要的朋友可以参考一下。
题目链接:
题目描述:
在一个 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'
思路:
这道题很无聊,一句话形容这道题目:老太太的裹脚布——又臭又长。
题目本身非常简单,但是题目描述让人一言难尽。
题目的意思是,棋盘中有一个“车”,问“车”向上下左右四个方向遍历能吃到多少个“卒”。条件是:
- 不能出棋盘;
- 遇到“象”不通;
- 一旦吃到“卒”了,这个方向上的遍历就结束了。
一旦描述清楚,题目就变得非常简单了。也懒得想了,直接简单粗暴吧。
class Solution {
public int numRookCaptures(char[][] board) {
// 结果数
int count = 0;
// 车的坐标
int rooki = 0, rookj = 0;
// 找到车的位置
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[i].length; j++) {
// 题目中已经说明只有一个“车”,所以一旦找到就可以终止寻找了。
// 但棋盘只有8*8,跳不跳循环也没啥区别。
if (board[i][j] == 'R') {
rooki = i;
rookj = j;
}
}
}
// 向左
for (int j = rookj; j >= 0; j--) {
if (board[rooki][j] == 'B') {
break;
}
if (board[rooki][j] == 'p') {
count ++;
break;
}
}
// 向右
for (int j = rookj; j < board[rooki].length; j++) {
if (board[rooki][j] == 'B') {
break;
}
if (board[rooki][j] == 'p') {
count ++;
break;
}
}
// 向上
for (int i = rooki; i >= 0; i--) {
if (board[i][rookj] == 'B') {
break;
}
if (board[i][rookj] == 'p') {
count ++;
break;
}
}
// 向下
for (int i = rooki; i < board.length; i++) {
if (board[i][rookj] == 'B') {
break;
}
if (board[i][rookj] == 'p') {
count ++;
break;
}
}
return count;
}
}
原文地址:https://www.cnblogs.com/ME-WE/p/12572819.html
- nyoj------170网络的可靠性
- HDUOJ-------1052Tian Ji -- The Horse Racing(田忌赛马)
- 初学Java之Pattern与Matcher类
- 初学java之StringBuffer类的常用方法
- 初学java之大数处理
- hdu---1024Max Sum Plus Plus(动态规划)
- Go语言异步服务器框架原理和实现
- nyoj------布线问题(kruscal+求最小值)
- nyoj-----127星际之门(一)
- nyoj------20吝啬的国度
- HDUOJ-------2493Timer(数学 2008北京现场赛H题)
- go sync.Mutex 设计思想与演化过程 (一)
- HDUOJ--------A simple stone game(尼姆博弈扩展)(2008北京现场赛A题)
- HDUOJ----2485 Destroying the bus stations(2008北京现场赛A题)
- JavaScript 教程
- JavaScript 编辑工具
- JavaScript 与HTML
- JavaScript 与Java
- JavaScript 数据结构
- JavaScript 基本数据类型
- JavaScript 特殊数据类型
- JavaScript 运算符
- JavaScript typeof 运算符
- JavaScript 表达式
- JavaScript 类型转换
- JavaScript 基本语法
- JavaScript 注释
- Javascript 基本处理流程
- Javascript 选择结构
- Javascript if 语句
- Javascript if 语句的嵌套
- Javascript switch 语句
- Javascript 循环结构
- Javascript 循环结构实例
- Javascript 跳转语句
- Javascript 控制语句总结
- Javascript 函数介绍
- Javascript 函数的定义
- Javascript 函数调用
- Javascript 几种特殊的函数
- JavaScript 内置函数简介
- Javascript eval() 函数
- Javascript isFinite() 函数
- Javascript isNaN() 函数
- parseInt() 与 parseFloat()
- escape() 与 unescape()
- Javascript 字符串介绍
- Javascript length属性
- javascript 字符串函数
- Javascript 日期对象简介
- Javascript 日期对象用途
- Date 对象属性和方法
- Javascript 数组是什么
- Javascript 创建数组
- Javascript 数组赋值与取值
- Javascript 数组属性和方法