在一个 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
解释:
象阻止了车捕获任何卒。
提示:
board.length == board[i].length == 8
board[i][j] 可以是 'R','.','B' 或 'p'
只有一个格子上存在 board[i][j] == 'R'
解法一:按题意即可
思路: 你有方向数组我有for循环;
class Solution {
public int numRookCaptures(char[][] board) {
int i=0,j=0;
for(i=0;i<board.length;i++){
for(j=0;j<board.length;j++){
if(board[i][j]=='R'){
break;
}
}
if(j<board.length&&board[i][j]=='R'){
break;
}
}
int c = 0;
for(int k=i-1;k>=0;k--){
if(board[k][j]=='B'){
break;
}
if(board[k][j]=='p'){
c++;
break;
}
}
for(int k=i+1;k<board.length;k++){
if(board[k][j]=='B'){
break;
}
if(board[k][j]=='p'){
c++;
break;
}
}
for(int k=j+1;k<board.length;k++){
if(board[i][k]=='B'){
break;
}
if(board[i][k]=='p'){
c++;
break;
}
}
for(int k=j-1;k>=0;k--){
if(board[i][k]=='B'){
break;
}
if(board[i][k]=='p'){
c++;
break;
}
}
return c;
}
}
解法二:方向数组
class Solution {
public:
int numRookCaptures(vector<vector<char>>& board) {
int cnt = 0, st = 0, ed = 0;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
for (int i = 0; i < 8; ++i) {
for (int j = 0; j < 8; ++j) {
if (board[i][j] == 'R') {
st = i;
ed = j;
break;
}
}
}
for (int i = 0; i < 4; ++i) {
for (int step = 0;; ++step) {
int tx = st + step * dx[i];
int ty = ed + step * dy[i];
if (tx < 0 || tx >= 8 || ty < 0 || ty >= 8 || board[tx][ty] == 'B') break;
if (board[tx][ty] == 'p') {
cnt++;
break;
}
}
}
return cnt;
}
};