题目
地上有一个m行n列的方格。一个机器人从坐标(0, 0)的格子开始移动,它每一次可以向左、右、上、下移动一格,但不能进入行坐标和列坐标的数位之和大于k的格子。例如,当k为18时,机器人能够进入方格(35, 37),因为3+5+3+7=18。但它不能进入方格(35, 38),因为3+5+3+8=19。请问该机器人能够到达多少个格子?
代码
package codingquestions;
public class RobotMove {
public static int movingcount(int threshold, int rows, int cols ) {
if (threshold <0 ||rows<=0 || cols <=0)
return 0;
int[][] note = new int [rows][cols];
for (int i=0; i < rows; i++) {
for (int j=0; j<cols;j++) {
note[i][j] = 0;
}
}
int count = movingcountcore(threshold,note, rows, cols, 0,0);
return count;
}
public static int cal(int num) {
int sum =0;
while (num>0) {
sum +=num % 10;
num =num/10;
}
return sum;
}
public static int movingcountcore(int threshold, int[][]note, int rows, int cols, int row, int col) {
if (col<0 || row<0 || col >=cols || row>=rows || note[row][col]==1 || (cal(row)+cal(col))>threshold) {
return 0;
}
note[row][col]=1;
return 1+movingcountcore(threshold, note, rows, cols, row-1, col)
+movingcountcore(threshold, note, rows, cols, row+1, col)
+movingcountcore(threshold, note, rows, cols, row, col-1)
+movingcountcore(threshold, note, rows, cols, row, col+1);
}
public static void main(String[] args) {
int count =movingcount(5,10,10);
System.out.println(count);
}
}