13 机器人的运动范围


#include <iostream>
using namespace std;

int getDigitSum(int number) {
	int sum = 0;

	while (number > 0) {
		sum += number % 10;
		number /= 10;
	}

	return sum;
}

bool check(int threshold, int rows, int cols, int row, int col, bool *visited) {
	if (row >= 0
		&& row < rows
		&& col >= 0
		&& col < cols
		&& getDigitSum(row) + getDigitSum(col) <= threshold
		&& !visited[row*cols + col]) {
		return true;
	}

	return false;
}

int movingCountCore(int threshold, int rows, int cols, int row, int col, bool* visited) {

	int count = 0;
	if (check(threshold, rows, cols, row, col, visited)) {	//边界检查都放到check里了
		visited[row*cols + col] = true;
		cout << "("<<row<<","<<col<<")" << endl;
		count = 1 + movingCountCore(threshold, rows, cols, row, col - 1, visited)
				  + movingCountCore(threshold, rows, cols, row, col+1, visited)
				  + movingCountCore(threshold, rows, cols, row-1, col, visited)
				  + movingCountCore(threshold, rows, cols, row+1, col, visited);
	}

	return count;
}

int movingCount(int threshold, int rows, int cols) {
	if (threshold < 0 || rows <= 0 || cols <= 0) {
		return 0;
	}

	bool *visited = new bool[rows * cols];
	for (int i = 0; i < rows * cols; i++) {
		visited[i] = false;
	}

	int count = movingCountCore(threshold, rows, cols, 0, 0, visited);

	delete[] visited;
	return count;
}



int main() {
	
	int count = movingCount(5, 10, 10);
	cout << count << endl;
	system("pause");
	return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值