题目描述:
地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
int getDigitSum(int number) {
int sum = 0;
while (number > 0) {//要是>=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(col) + getDigitSum(row) <= threshold && !visited[cols*row + col])
{//cols*row + 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)) {
visited[row*cols + col] = true;
count = 1 + movingCountCore(threshold, rows, cols, row - 1, col, visited)
+ movingCountCore(threshold, rows, cols, row, col - 1, visited)
+ movingCountCore(threshold, rows, cols, row + 1, col, visited)
+ movingCountCore(threshold, rows, cols, row, col + 1, 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];
memset(visited, 0, rows*cols);
int count = movingCountCore(threshold, rows, cols, 0, 0, visited);
delete[] visited;
return count;
}