问题描述:
地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
源码:
非常直白的贪心算法(但是其实少了回溯过程)。
class Solution {
public:
int movingCount(int threshold, int rows, int cols)
{
if(threshold<0 || rows<=0 || cols<=0) return 0;
int count = 0;
bool* visit = new bool[rows*cols];
memset(visit, 0, rows*cols);
count = movingCountCore(threshold, rows, cols, 0, 0, visit);
delete[] visit;
return count;
}
int movingCountCore(int threshold, int rows, int cols, int row, int col, bool *visit){
int count = 0;
if(check(threshold, row, col) && row>=0 && row<rows && col>=0 && col<cols && !visit[row*cols+col]){
visit[row * cols + col] = true;
count = 1 + movingCountCore(threshold, rows, cols, row+1, col, visit)
+ movingCountCore(threshold, rows, cols, row-1, col, visit) +
movingCountCore(threshold, rows, cols, row, col+1, visit) +
movingCountCore(threshold, rows+1, cols, row, col-1, visit);
}
return count;
}
bool check(int threshold, int row, int col){
if(add(row) + add(col) <= threshold)
return true;
return false;
}
int add(int num){
int sum = 0;
while(num>0){
sum += num % 10;
num /= 10;
}
return sum;
}
};