地上有一个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)
{
if(rows<1||cols<1||threshold<0){
return 0;
}
int count = 0;
boolean[] arr = new boolean[rows*cols];
count = movCountCore(threshold, rows, cols, 0, 0, arr);
return count;
}
private int movCountCore(int threshold, int rows, int cols,int row,int col,boolean[] arr) {
// TODO Auto-generated method stub
int count = 0;
if(check(threshold,rows,cols,row,col,arr)){
arr[row*cols+col] = true;
count = 1+movCountCore(threshold, rows, cols, row, col-1, arr)+
movCountCore(threshold, rows, cols, row-1, col, arr)+
movCountCore(threshold, rows, cols, row, col+1, arr)+
movCountCore(threshold, rows, cols, row+1, col, arr);
}
return count;
}
private boolean check(int threshold, int rows, int cols, int row, int col, boolean[] arr) {
// TODO Auto-generated method stub
if(row>=0&&col>=0&&row<rows&&col<cols&&!arr[row*cols+col]&&((getdiSum(row)+getdiSum(col))<=threshold)){
return true;
}
return false;
}
private int getdiSum(int row) {
// TODO Auto-generated method stub
int sum = 0;
while(row>0){
sum+=row%10;
row/=10;
}
return sum;
}
}