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