leetcode 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(vector<vector<char>>& board) {
int rockRow = 0, rockCol = 0;
bool getLoc = false;
for (int i = 0; i < 8; ++i) {
for (int j = 0; j < 8; ++j) {
if (board[i][j] == 'R') {
rockRow = i;
rockCol = j;
getLoc = true;
break;
}
}
if (getLoc) {
break;
}
}
int res = 0;
for (int row = rockRow - 1; row >= 0; --row) {
if (board[row][rockCol] == 'B') {
break;
}
if (board[row][rockCol] == 'p') {
res += 1;
break;
}
}
for (int row = rockRow + 1; row < 8; ++row) {
if (board[row][rockCol] == 'B') {
break;
}
if (board[row][rockCol] == 'p') {
res += 1;
break;
}
}
for (int col = rockCol - 1; col >= 0; --col) {
if (board[rockRow][col] == 'B') {
break;
}
if (board[rockRow][col] == 'p') {
res += 1;
break;
}
}
for (int col = rockCol + 1; col < 8; ++col) {
if (board[rockRow][col] == 'B') {
break;
}
if (board[rockRow][col] == 'p') {
res += 1;
break;
}
}
return res;
}
};
我的成绩
执行结果:通过
执行用时 : 0 ms, 在所有 C++ 提交中击败了100.00%的用户
内存消耗 : 6.1 MB, 在所有 C++ 提交中击败了100.00%的用户
一些想法
- 本道题是一道简单题,做起来也很简单,即先找到车所在的位置,然后分别向四个方向走,处理可能遇到的情况即可。
执行用时为 0 ms 的范例
class Solution {
public:
int numRookCaptures(vector<vector<char>>& board) {
int row,col;
for(int i = 0; i<board.size();i++)
for(int j = 0;j<board[0].size();j++){
if(board[i][j] == 'R') {row = i;col = j;break;}
}
int i = col,j = col;
int count = 0;
while(i>=0){
if(board[row][i] == 'B') break;
if(board[row][i] == 'p') {count++;break;}
i--;
}
while(j < board[0].size()){
if(board[row][j] == 'B') break;
if(board[row][j] == 'p') {count++;break;}
j++;
}
i = row,j = row;
while(i>=0){
if(board[i][col] == 'B') break;
if(board[i][col] == 'p') {count++;break;}
i--;
}
while(j<board.size()){
if(board[j][col] == 'B') break;
if(board[j][col] == 'p') {count++;break;}
j++;
}
return count;}
};
思考
范例做法和我相同。