我GitHub上的:剑指offer题解
题目:地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
与题12:矩阵中的路径类似
public class MovingCount {
public static int movingCount(int threshold, int rows, int cols)
{
if(threshold < 0 || rows < 0 || cols < 0) {
return 0;
}
//初始化为false,若走过,怎为true
boolean[] flag = new boolean[rows*cols];
int count = movingCountCore(threshold, 0, 0, rows, cols, flag);
return count;
}
public static int movingCountCore(int threshold, int i, int j, int rows,int cols, boolean[] flag) {
int count = 0;
if(check(threshold, i, j, rows, cols, flag)) {
//机器人进入该格子
flag[i*cols+j] = true;
count = 1 + movingCountCore(threshold, i+1, j, rows, cols, flag)
+ movingCountCore(threshold, i-1, j, rows, cols, flag)
+ movingCountCore(threshold, i, j+1, rows, cols, flag)
+ movingCountCore(threshold, i, j-1, rows, cols, flag);
}
return count;
}
//判断机器人能够进入坐标(i,j),能就返回true
private static boolean check(int threshold, int i,int j, int rows, int cols, boolean[] flag) {
if(i >= 0 && i < rows && j >= 0 && j < cols &&
getDigitSum(i) + getDigitSum(j) <= threshold
&& !flag[i*cols+j]) {
return true;
}
return false;
}
//坐标数位之和
private static int getDigitSum(int num) {
int sum = 0;
while (num > 0) {
sum += num % 10;
num /= 10;
}
return sum;
}
public static void main(String[] args) {
int threshold = 2;
int rows = 4, cols = 4;
System.out.println(movingCount(threshold, rows, cols));
}
}