[数组][简单]999.车的可用捕获量

---

tags:

• 简单
• 有思路不会
• 数组

flag: green

data: ‘2019-6-10’

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 xR = 0,yR = 0,count = 0;
        for(int i = 0; i < board.length; i++){
            for(int j = 0; j < board.length; j++){
                if(board[i][j] == 'R'){
                    xR = i;
                    yR = j;
                }
            }
        }
        //扫描左边
        for(int i = yR - 1; i >=0 ; i--){
            if(board[xR][i] == 'p'){
                count++;
                break;
            }
            else if(board[xR][i] == 'B')
                break;
        }
        //扫描上边
        for(int i = xR - 1; i >=0 ; i--){
            if(board[i][yR] == 'p'){
                count++;
                break;
            }
            else if(board[i][yR] == 'B')
                break;
        }
        //扫描右边
        for(int i = yR + 1; i < board.length; i++){
            if(board[xR][i] == 'p'){
                count++;
                break;
            }
            else if(board[xR][i] == 'B')
                break;
        }
        //扫描下边
        for(int i = xR + 1; i < board.length; i++){
            if(board[i][yR] == 'p'){
                count++;
                break;
            }
            else if(board[i][yR] == 'B')
                break;
        }
        return count;
    }
}

个人解法同该方法：

• 解答二：

class Solution {
    public int numRookCaptures(char[][] board) {
        //首先得到车的位置
        int xR = 0,yR = 0;
        int N = board.length;

        for (int i = 0; i < N; i++ ) {
            for (int j = 0; j < N; j++) {
                if (board[i][j] == 'R') {
                    xR = i;
                    yR = j;
                    break;
                }
            }
        }


        //使车可以上下左右移动
        int[][] num = new int[][]{{0,1},{1,0},{0,-1},{-1,0}};
        int count = 0;

        for (int i = 0; i < 4; i++) {
            int x = xR + num[i][0];
            int y = yR + num[i][1];

            while(x > 0 && x < 8 && y > 0 && y < 8){
                if (board[x][y] != '.') {
                    if (board[x][y] == 'p') {
                        count++;
                    }
                    break;
                }else{
                    x += num[i][0];
                    y += num[i][1];
                }
            }
        }
        
        return count;
    }
}

执行用时 : 1 ms, 在Available Captures for Rook的Java提交中击败了49.20% 的用户

内存消耗 : 33.7 MB, 在Available Captures for Rook的Java提交中击败了79.00% 的用户