题目描述
地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
例如:输入(15,20,20),输出359
class Solution {
public int movingCount(int threshold, int rows, int cols)
{
int count=0;
int[][] map=new int[rows][cols];
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
if(getthresh(i, j)<=threshold){
map[i][j]=1;
}
}
}
for (int[] is : map) {
for (int is2 : is) {
System.out.printf("%d ",is2);
}
System.out.println();
}
count=judge(0, 0, map);
return count;
}
public int getsum(int x){
int sum=0;
while(x>0){
int add=x%10;
x/=10;
sum+=add;
}
return sum;
}
public int getthresh(int x,int y){
return getsum(x)+getsum(y);
}
public int judge(int x,int y,int[][] map) {
if(x<0||y<0||x>=map.length||y>=map[0].length||map[x][y]==0||map[x][y]==2){
return 0;
}
map[x][y]=2; //已经看过的点不再重复看
// return 1+judge(x-1, y, map)+judge(x+1, y, map)+judge(x, y-1, map)+judge(x, y+1, map);
return 1+judge(x+1, y, map)+judge(x, y+1, map)+judge(x-1, y, map)+judge(x, y-1, map);
}
}