题目:地上有一个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 [ ] flag = new boolean [ rows * cols] ;
return help2 ( threshold, rows, cols, 0 , 0 , flag) ;
}
public int help2 ( int threshold, int rows, int cols, int rowIndex, int colIndex, boolean [ ] flag) {
if ( ! ( 0 <= rowIndex && rowIndex < rows && 0 <= colIndex && colIndex < cols) ) {
return 0 ;
}
int index = rowIndex * cols + colIndex;
if ( flag[ index] == true ) {
return 0 ;
}
if ( help2 ( rowIndex) + help2 ( colIndex) > threshold) {
return 0 ;
}
flag[ index] = true ;
return help2 ( threshold, rows, cols, rowIndex + 1 , colIndex, flag) +
help2 ( threshold, rows, cols, rowIndex - 1 , colIndex, flag) +
help2 ( threshold, rows, cols, rowIndex, colIndex + 1 , flag) +
help2 ( threshold, rows, cols, rowIndex, colIndex - 1 , flag) + 1 ;
}
public int help2 ( int i) {
int sum = 0 ;
do {
sum += i % 10 ;
} while ( ( i = i / 10 ) > 0 ) ;
return sum;
}
}