问题描述:地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
思路:回朔法,需要判断每个格子的行列坐标位数之和是否大于给定的k,如果不满足,则依次探索该格子上下左右四个格子(除边界外)。
代码:
public class Solution {
public int movingCount(int threshold, int rows, int cols){
boolean[] visited = new boolean[rows * cols];
return movingCountCore(threshold, rows, cols, 0, 0, visited);
}
public int movingCountCore(int threshold, int rows, int cols, int row, int col, boolean[] visited){
if(row < 0 || row >= rows || col < 0 || col >= cols){
return 0;
}
if(visited[row * cols + col] || !checkSum(threshold, row, col)){
return 0;
}
visited[row * cols + col] = true;
return 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);
}
public boolean checkSum(int threshold, int row, int col){
int sum = 0;
while(row != 0){
sum += row%10;
row /= 10;
}
while(col != 0){
sum += col%10;
col /= 10;
}
return sum <= threshold ? true : false;
}
}