Description:地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
public class Solution {
public int movingCount(int threshold, int rows, int cols)
{
boolean[][] vis = new boolean[rows][cols];
return backtrack(threshold, rows, cols,0, 0, vis);
}
public int backtrack(int threshold, int rows, int cols, int i, int j, boolean[][] vis) {
if (i < 0 || i >= rows || j < 0 || j>= cols || vis[i][j])
return 0;
if (!judgement(i, j, threshold))
return 0;
vis[i][j] = true;
return backtrack(threshold, rows, cols, i + 1, j, vis)
+ backtrack(threshold, rows, cols,i - 1, j, vis)
+ backtrack(threshold, rows, cols, i, j + 1, vis)
+ backtrack(threshold, rows, cols, i, j - 1, vis)
+ 1;
}
public boolean judgement(int row, int col, int threshold) {
int sum = 0;
while (row > 0) {
sum += row % 10;
row /= 10;
}
while (col > 0) {
sum += col % 10;
col /= 10;
}
return sum <= threshold;
}
}