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'

 

每日打卡，直接找到车，递归求就行。

#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
	int numRookCaptures(vector<vector<char>>& board) {
		int x = 0;
		int y = 0;
		/* 判断是否找到车 */
		int isFind = false;
		int num = 0;
		for (int i = 0; i < board.size(); i++) {
			/* 找到就跳出循环 */
			if (isFind) {
				break;
			}
			for (int j = 0; j < board[i].size(); j++) {
				if (board[i][j] == 'R') {
					x = i;
					y = j;
					break;
				}
			}
		}
		x_up(x, y, board, num);
		x_down(x, y, board, num);
		y_up(x, y, board, num);
		y_down(x, y, board, num);

		return num;
	}

private:
	void x_up(int x, int y, vector<vector<char>>& grid, int& num) {
		if (Judge(x, y, grid, num)) {
			x_up(x + 1, y, grid, num);
		}
	}
	void x_down(int x, int y, vector<vector<char>>& grid, int& num) {
		if (Judge(x, y, grid, num)) {
			x_down(x - 1, y, grid, num);
		}
	}
	void y_up(int x, int y, vector<vector<char>>& grid, int& num) {
		if (Judge(x, y, grid, num)) {
			y_up(x, y + 1, grid, num);
		}
	}
	void y_down(int x, int y, vector<vector<char>>& grid, int& num) {
		if (Judge(x, y, grid, num)) {
			y_down(x, y - 1, grid, num);
		}
	}

	bool Judge(int x, int y, vector<vector<char>>& grid, int& num) {
		if (x >= grid.size() || x < 0) {
			return false;
		}
		if (y >= grid[x].size() || y < 0) {
			return false;
		}
		if (grid[x][y] == 'B') {
			return false;
		}
		if (grid[x][y] == 'p') {
			num++;
			return false;
		}
		return true;
	}
};