//13机器人的运动范围
// 题目:地上有一个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 getSum(int num);
bool checkInOrOut(const int rows, const int cols, int row, int col, int threshold, bool *visited);
int countCore(const int rows, const int cols, const int threshold, int row, int col, bool *visited);
int count(const int rows, const int cols, const int thresholdvaule);
int main()
{
int row = 3, col = 4;
int thresholdvalue = 8;
int num=count(row, col, thresholdvalue);
cout << "the numbers of box are: " << num << endl;
cin.get();
return 0;
}
int getSum(int num)
{
int sum = 0;
while (num > 0)
{
sum += num % 10;
num = num / 10;
}
return sum;
}
bool checkInOrOut(const int rows, const int cols, int row, int col, int threshold, bool *visited)
{
if (row >= 0 && row < rows&&col >= 0 && col < cols&&getSum(row) + getSum(col) <= threshold && !visited[row*cols + col])
return true;
return false;
}
int countCore(const int rows, const int cols, const int threshold, int row, int col, bool *visited)
{
int count = 0;
if (checkInOrOut(rows, cols, row, col, threshold, visited))
{
visited[row*cols + col] = true;
count = 1 + countCore(threshold, rows, cols, row - 1, col, visited)
+ countCore(threshold, rows, cols, row, col - 1, visited)
+ countCore(threshold, rows, cols, row + 1, col, visited)
+ countCore(threshold, rows, cols, row, col + 1, visited);
}
return count;
}
int count(const int rows, const int cols, const int thresholdvaule)
{
if (rows<0 || cols<0 || thresholdvaule<0)
{
return 0;
}
bool *visited = new bool[rows*cols];
memset(visited, 0, rows*cols);
int count = countCore(rows, cols, thresholdvaule, 0, 0, visited);
delete[] visited;
return count;
}