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