题目:地上有一个m行n列的方格。一个机器人从坐标(0, 0)的格子开始移动,它每一次可以向左、右、上、下移动一格,但不能进入行坐标和列坐标的数位之和大于k的格子。例如,当k为18时,机器人能够进入方格(35, 37),因为3+5+3+7=18。但它不能进入方格(35, 38),因为3+5+3+8=19。请问该机器人能够到达多少个格子?
#include<iostream>
using namespace std;
int movingCountCore(int threshold, int rows, int cols, int row, int col, bool*visited);
bool check(int threshold, int rows, int cols, int row, int col, bool*visited);
int getDigitSum(int number);
int movingCount(int threshold, int rows, int cols)
{
//判断边界条件
if (threshold < 0 || rows <= 0 || cols <= 0)
return 0;
//visited判断是否访问过该元素
bool * visited = new bool[rows*cols];
//初始化visited为false;
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 movingCountCore(int threshold, int rows, int cols, int row, int col, bool*visited)
{
int count = 0;
//判断是否行坐标和列坐标的数位之和大于k
if (check(threshold, rows, cols, row, col, visited))
{
//符合条件则将相应的visited置true,并继续判断上下左右的元素
visited[row*cols + col] = true;
count = 1 + movingCountCore(threshold, rows, cols, row + 1, col, visited) + movingCountCore(threshold, rows, cols, row - 1, col, visited)
+ movingCountCore(threshold, rows, cols, row, col + 1, visited) + movingCountCore(threshold, rows, cols, row, col - 1, visited);
}
return count;
}
//判断是否行坐标和列坐标的数位之和大于k
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 getDigitSum(int number)
{
int sum = 0;
while (number > 0)
{
sum += number % 10;
number /= 10;
}
return sum;
}
//测试输入
void Test1()
{
printf("可以移动的格子总共有:%d\n", movingCount(5, 3, 3));
}
void Test2()
{
printf("可以移动的格子总共有:%d\n", movingCount(5, 10, 10));
}
void Test3()
{
printf("可以移动的格子总共有:%d\n", movingCount(5, 1,3));
}
void Test4()
{
printf("可以移动的格子总共有:%d\n", movingCount(0, 1, 3));
}
int main()
{
Test1();
Test2();
Test3();
Test4();
return 0;
}