【LeetCode每日一题】车的可用捕获量

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

C++1 循环遍历

1、先找白车R的位置,找到之后用tx,ty记下。
2、上下左右四个方向用两个数组保存,然后从白车的位置分别遍历四个方向上有无黑卒p,找到则将最后结果res加一,跳出此方向,否则一直走到头(当第一次遇到黑卒且之前没有白象时才算做计数);

class Solution {
public:
    int numRookCaptures(vector<vector<char>>& board) {
        int h = board.size();
        int w = board[0].size();
        int tx,ty;
        for(int i=0;i<h;i++){
            for(int j=0;j<w;j++){
                if(board[i][j] == 'R'){
                    tx = i;
                    ty = j;
                    break;
                }
            }
        }
        int res = 0;
        int dx[] = {-1,1,0,0};
        int dy[] = {0,0,1,-1};
        for(int k=0;k<4;k++){
            int flag = 0; // 0表示白车可以往前走,找到白象时设为1
            int x = tx, y = ty;
            x = x+dx[k];
            y = y+dy[k];
            while(x>=0&&x<h&&y>=0&&y<w){
                if(flag == 1){
                    break;
                }
                if(board[x][y] == 'p'&& flag == 0){
                    res++;
                    break;
                }else if(board[x][y] == 'B'){
                    flag = 1;
                }
                x = x+dx[k];
                y = y+dy[k];
            }
        }
        return res;
    }
};

执行结果

执行用时 :4 ms, 在所有 C++ 提交中击败了58.90%的用户
内存消耗 :6.1 MB, 在所有 C++ 提交中击败了100.00%的用户

复杂度分析

时间复杂度:O(n2)O(n^2),其中 n 是棋盘的边长。找白色车在棋盘中的位置需要 O(n2)O(n^2) 的时间复杂度,模拟车在四个方向上捕获颜色相反的卒需要 O(n) 的时间复杂度,所以一共需要 O(n2+n)=O(n2)O(n^2+n) = O(n^2)的时间复杂度。

空间复杂度:O(1),只需要常数空间存放若干变量。

发布了161 篇原创文章 · 获赞 331 · 访问量 23万+
展开阅读全文

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

©️2019 CSDN 皮肤主题: 黑客帝国 设计师: 上身试试

分享到微信朋友圈

×

扫一扫,手机浏览