• 博客园logo
  • 会员
  • 众包
  • 新闻
  • 博问
  • 闪存
  • 赞助商
  • HarmonyOS
  • Chat2DB
    • 搜索
      所有博客
    • 搜索
      当前博客
  • 写随笔 我的博客 短消息 简洁模式
    用户头像
    我的博客 我的园子 账号设置 会员中心 简洁模式 ... 退出登录
    注册 登录
村雨sup
自己选的路,跪着也要走完 XD
博客园    首页    新随笔    联系   管理    订阅  订阅
Leetcode 999. 车的可用捕获量

999. 车的可用捕获量

 
我的提交返回竞赛
 
  • 用户通过次数255
  • 用户尝试次数260
  • 通过次数255
  • 提交次数357
  • 题目难度Easy

在一个 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 的卒。

 

提示:

  1. board.length == board[i].length == 8
  2. board[i][j] 可以是 'R','.','B' 或 'p'
  3. 只有一个格子上存在 board[i][j] == 'R'
class Solution {
public:
    int numRookCaptures(vector<vector<char>>& board) {
        int n=0,m=0;
        for(int i=0;i < board.size();i++){
            for(int j=0;j < board[0].size();j++){
                if(board[i][j] == 'R'){n=i;m=j;}
            }
        }
        int res = 0;
        for(int i=n-1;i>=0;i--){
            if(board[i][m] == 'B')break;
            else if(board[i][m] == 'p'){res++;break;}
        }
        for(int i=n+1;i<board.size();i++){
            if(board[i][m] == 'B')break;
            else if(board[i][m] == 'p'){res++;break;}
        }
        for(int j=m-1;j>=0;j--){
            if(board[n][j] == 'B')break;
            else if(board[n][j] == 'p'){res++;break;}
        }
        for(int j=m+1;j<board[0].size();j++){
            if(board[n][j] == 'B')break;
            else if(board[n][j] == 'p'){res++;break;}
        }
        return res;   
    }
};

-HAOSHUIA

posted on 2019-04-03 23:21  村雨sup  阅读(148)  评论(0)    收藏  举报
刷新页面返回顶部
博客园  ©  2004-2025
浙公网安备 33010602011771号 浙ICP备2021040463号-3