题目描述:
题目:地上有一个m行n列的方格。一个机器人从坐标(0, 0)的格子开始移动,它每一次可以向左、右、上、下移动一格,但不能进入行坐标和列坐标的数位之和大于k的格子。例如,当k为18时,机器人能够进入方格(35, 37),因为3+5+3+7=18。但它不能进入方格(35, 38),因为3+5+3+8=19。请问该机器人能够到达多少个格子?
bool inRange(int row,int col,int threshold)
{
int res=0;
while(row!=0)
{
res+=row%10;
row/=10;
}
while(col!=0)
{
res+=col%10;
col/=10;
}
if(res<=threshold) return true;
return false;
}
void dfs(int threshold,int rows,int cols,int row,int col,bool* visited,int &ans)
{
int dir[][2]{{1,0},{0,1},{-1,0},{0,-1}};
for(int i=0;i<4;i++)
{
int nowRow=row+dir[i][0];
int nowCol=col+dir[i][1];
if(nowRow>=0&&nowRow<rows&&nowCol>=0&&nowCol<cols&&!visited[nowRow*cols+nowCol])
{
visited[nowRow*cols+nowCol]=true;
if(inRange(nowRow,nowCol,threshold))
{
ans++;
dfs(threshold,rows,cols,nowRow,nowCol,visited,ans);
}
}
}
}
int movingCount(int threshold, int rows, int cols)
{
if(threshold<0||rows<=0||cols<=0) return 0;
//如果是一行一列的矩阵,这个算法不能正常执行,此时机器人能到达的格子数是1,特直接返回1
if(rows==1&&cols==1) return 1;
bool visited[rows*cols];
memset(visited,false,sizeof(visited));
int ans=0;
dfs(threshold,rows,cols,0,0,visited,ans);
return ans;
}
书上的算法即使是一行一列也能正常执行,不需要特判
int movingCount(int threshold, int rows, int cols)
{
if(threshold < 0 || rows <= 0 || cols <= 0)
return 0;
bool *visited = new bool[rows * cols];
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;
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;
}
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;
}