999:车的可用捕获量

问题描述

在一个 8 x 8 的棋盘上,有一个白色车(rook)。也可能有空方块,白色的象(bishop)和黑色的卒(pawn)。它们分别以字符 “R”,“.”,“B” 和 “p” 给出。大写字符表示白棋,小写字符表示黑棋。

车按国际象棋中的规则移动:它选择四个基本方向中的一个(北,东,西和南),然后朝那个方向移动,直到它选择停止、到达棋盘的边缘或移动到同一方格来捕获该方格上颜色相反的卒。另外,车不能与其他友方(白色)象进入同一个方格。

返回车能够在一次移动中捕获到的卒的数量。

示例

在这里插入图片描述

输入:[[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]
输出:3
解释:
在本例中,车能够捕获所有的卒。

在这里插入图片描述

输入:[[".",".",".",".",".",".",".","."],[".","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
解释:
象阻止了车捕获任何卒。

在这里插入图片描述

输入:[[".",".",".",".",".",".",".","."],[".",".",".","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’

思路

这题总结一下就是,话多,题简单。
说人话就是:
车的行走路线只能是以车为中点的十字。
在这个十字上,会吃掉第一个遇到的卒子。
如果遇到了白象,则停下。遇到了边界,也停下。

于是乎写出了可读性强的代码。(方法一)

方法一可读性是强,但是代码写的有点多。且重复。用方向数组优化一下。
何为方向数组?就是说设置一个自增step。 每次用1 or -1 乘以这个step,就模拟了向左走还是向右走。 由于这题在x走的时候y就不走,所以对于x和y都要设置一个step。而且对比着来看要一个是0一个是非0的组合。(方法二)

方法一

public int numRookCaptures1(char[][] board) {
        if(board.length == 0 || board[0].length == 0){
            return 0;
        }
        int[] coord = getCoord(board);
        if(coord == null){
            return 0;
        }
        int x = coord[0],y = coord[1];
        char[] pool = new char[]{'东','西','南','北'};
        int res = 0;
        for(char direc: pool){
            res += move(x,y,direc,board);
        }
        return res;
    }
    private int[] getCoord(char[][] board){
        int[] res = new int[2];
        for(int i = 0; i < board.length; i++){
            for(int j = 0; j < board[0].length; j++){
                if(board[i][j] == 'R'){
                    res[0] = i;
                    res[1] = j;
                    return res;
                }
            }
        }
        return null;
    }
    private int move(int x,int y, char direc, char[][] board){
        if(direc == '东'){
            for(int i = x+1; i < board[0].length; i++){
                if(board[i][y] == 'p'){
                    return 1;
                }else if(board[i][y] == 'B'){
                    return 0;
                }
            }
            return 0;
        }else if(direc == '西'){
            for(int i = x-1; i > -1; i--){
                if(board[i][y] == 'p'){
                    return 1;
                }else if(board[i][y] == 'B'){
                    return 0;
                }
            }
            return 0;
        }else if(direc == '南'){
            for(int i = y+1; i < board.length; i++){
                if(board[x][i] == 'p'){
                    return 1;
                }else if(board[x][i] == 'B'){
                    return 0;
                }
            }
            return 0;
        }else{
            for(int i = y-1; i > -1; i--){
                if(board[x][i] == 'p'){
                    return 1;
                }else if(board[x][i] == 'B'){
                    return 0;
                }
            }
            return 0;
        }
    }

方法二

class Solution {
    public int numRookCaptures(char[][] board){
        if(board.length == 0 || board[0].length == 0){
            return 0;
        }
        int[] coord = getCoord(board);
        if(coord == null){
            return 0;
        }
        int x = coord[0],y = coord[1];
        int res = 0;
        int[] stepX = new int[]{1,0,-1,0};
        int[] stepY = new int[]{0,1,0,-1};
        for(int i = 0; i < 4; i++){
            for(int base = 0;; base++){
                int tmpX = x + base*stepX[i];
                int tmpY = y + base*stepY[i];
                if(tmpX < 0 || tmpX > 7 || tmpY < 0 || tmpY > 7 || board[tmpX][tmpY] == 'B'){
                    break;
                }
                if(board[tmpX][tmpY] == 'p'){
                    res++;
                    break;
                }
            }
        }
        return res;
    }
    private int[] getCoord(char[][] board){
        int[] res = new int[2];
        for(int i = 0; i < board.length; i++){
            for(int j = 0; j < board[0].length; j++){
                if(board[i][j] == 'R'){
                    res[0] = i;
                    res[1] = j;
                    return res;
                }
            }
        }
        return null;
    }
}
发布了445 篇原创文章 · 获赞 21 · 访问量 3万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 编程工作室 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览