// 面试题13:机器人的运动范围
// 题目:地上有一个m行n列的方格。一个机器人从坐标(0, 0)的格子开始移动,它
// 每一次可以向左、右、上、下移动一格,但不能进入行坐标和列坐标的数位之和
// 大于k的格子。例如,当k为18时,机器人能够进入方格(35, 37),因为3+5+3+7=18。
// 但它不能进入方格(35, 38),因为3+5+3+8=19。请问该机器人能够到达多少个格子?
static int moving_count(int threshold, int rows, int cols)
{
if(threshold < 0 || rows <= 0 || cols <= 0)
return 0;
int count=0;
for(int32_t row = 0; row < rows; ++row)
{
for(int32_t col = 0; col < cols; ++col)
{
if(_digit_sum(row) + _digit_sum(col) <= threshold)
{
count++;
}
}
}
return count;
}
static int moving_count_r(int threshold, int rows, int cols)
{
if(threshold < 0 || rows <= 0 || cols <= 0)
return 0;
std::vector<bool> visited(rows * cols, false);
int count = _moving_count_r(threshold, rows, cols, 0, 0, visited);
return count;
}
static int _moving_count_r(int threshold, int rows, int cols, int row,
int col, std::vector<bool>& visited)
{
int count = 0;
if(row >= 0 && row < rows && col >= 0 && col < cols
&& _digit_sum(row) + _digit_sum(col) <= threshold
&& !visited[row* cols + col])
{
visited[row * cols + col] = true;
count = 1 + _moving_count_r(threshold, rows, cols, row - 1, col, visited)
+ _moving_count_r(threshold, rows, cols, row, col - 1, visited)
+ _moving_count_r(threshold, rows, cols, row + 1, col, visited)
+ _moving_count_r(threshold, rows, cols, row, col + 1, visited);
}
return count;
}
static int _digit_sum(int number)
{
int sum = 0;
while(number > 0)
{
sum += number % 10;
number /= 10;
}
return sum;
}