题目
该系列文章题目和思路均参考自:《剑指Offer》- Page 92
解法
与题目11类似,可以将方格看做一个mxn的矩阵。依然使用回溯法求解。在这个矩阵中,除边界上的格子之外,其他格子都有4个相邻的格子。机器人从坐标(0,0)开始移动,当他准备进入坐标(i,j)的格子时,通过检查坐标的数位和来判断机器人能够进入,如果机器人能够进入坐标为(i,j)的格子,则在判断它能否进入4个相邻的格子(i,j-1),(i-1,j),(i,j+1),(i+1,j)。
实现代码如下:
public class RobortMovingCount {
private static int movingCount(int threshold, int rows, int cols) {
if (threshold < 0 || rows <= 0 || cols <= 0) {
return 0;
}
boolean[] visited = new boolean[rows * cols];
for (int i = 0; i < rows * cols; i++) {
visited[i] = false;
}
int count = movingCountCore(threshold, rows, cols, 0, 0, visited);
return count;
}
private static int movingCountCore(int threshold, int rows, int cols, int row, int col, boolean[] 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;
}
private static boolean check(int threshold, int rows, int cols, int row, int col, boolean[] visited) {
if (row >= 0 && row < rows && col >= 0 && col < cols && getDigitSum(row) + getDigitSum(col) < threshold && !visited[row * cols + col]) {
return true;
}
return false;
}
private static int getDigitSum(int number) {
int sum = 0;
while (number > 0) {
sum += number % 10;
number /= 10;
}
return sum;
}
public static void main(String[] args) {
int result = movingCount(18, 50, 50);
System.out.println(result);
}
}