题目: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'
我的思路:
第一想法,首先一定要先找到车R的位置才能进行后续的操作,找到车R的位置,我只想到了遍历数组。
第二步,再对车R的上下左右进行判断。有这么几种情况:1、这个方向上没有任何东西。2、这个方向有白象(B)挡了。3、这个方向上有黑卒(p)。因为碰到第一个东西或者是碰到底就会结束判断因此四个方向四个for循环,循环四个方向。
class Solution {
public int numRookCaptures(char[][] board) {
int row = 0;
int column = 0;
//找到车的位置,并用row,column记录行列下标
for(int i = 0; i < board.length; i++){
for(int j = 0; j < board[i].length; j++){
if(board[i][j] == 'R'){
row = i;
column = j;
break;
}
}
}
int num = 0;
for(int i = row - 1; i >= 0; i--){
if(board[i][column] == '.'){
continue;
}
if(board[i][column] == 'p'){
num++;
break;
}else{
break;
}
}
for(int i = row + 1; i < board.length; i++){
if(board[i][column] == '.'){
continue;
}
if(board[i][column] == 'p'){
num++;
break;
}else{
break;
}
}
for(int j = column - 1; j >= 0; j--){
if(board[row][j] == '.'){
continue;
}
if(board[row][j] == 'p'){
num++;
break;
}else{
break;
}
}
for(int j = column + 1; j <board[row].length; j++){
if(board[row][j] == '.'){
continue;
}
if(board[row][j] == 'p'){
num++;
break;
}else{
break;
}
}
return num;
}
}
大佬解法也差不多,这道题就是阅读理解,就只有一个点,方向数组
class Solution {
public int numRookCaptures(char[][] board) {
// 定义上下左右四个方向
int[] dx = {-1, 1, 0, 0};
int[] dy = {0, 0, -1, 1};
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
// 找到白车所在的位置
if (board[i][j] == 'R') {
// 分别判断白车的上、下、左、右四个方向
int res = 0;
for (int k = 0; k < 4; k++) {
int x = i, y = j;
while (true) {
x += dx[k];
y += dy[k];
if (x < 0 || x >= 8 || y < 0 || y >= 8 || board[x][y] == 'B') {
break;
}
if (board[x][y] == 'p') {
res++;
break;
}
}
}
return res;
}
}
}
return 0;
}
}
作者:sweetiee
链接:https://leetcode-cn.com/problems/available-captures-for-rook/solution/jian-dan-java100-by-sweetiee/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
方向数组可以省略很多代码。阅读理解题,主要是解法。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/available-captures-for-rook
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。