题目描述
地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
解题思路
最后一题了哈哈,dfs经典题,没啥坑点
Code
class Solution {
public:
int getDigitsSum(int number) {
int sum = 0;
while(number) {
sum += number%10;
number /= 10;
}
return sum;
}
int dfs(int threshold, int rows, int cols, int i, int j, int vis[]) {
if(i>=rows || i<0 || j>=cols || j<0 || vis[i*cols+j] || getDigitsSum(i)+getDigitsSum(j) > threshold) return 0;
vis[i*cols+j] = 1;
int result = 1;
result += dfs(threshold, rows, cols, i-1, j, vis);
result += dfs(threshold, rows, cols, i, j-1, vis);
result += dfs(threshold, rows, cols, i+1, j, vis);
result += dfs(threshold, rows, cols, i, j+1, vis);
return result;
}
int movingCount(int threshold, int rows, int cols)
{
int result = 0;
int vis[rows*cols+1];
memset(vis, 0, sizeof(vis));
return dfs(threshold, rows, cols, 0, 0, vis);
}
};
- java
public class Solution {
private int result = 0;
private boolean[][] vis;
private final int[] dirx = {-1, 0, 1, 0};
private final int[] diry = {0, 1, 0, -1};
public int getDigitSum(int number) {
int sum = 0;
while(number != 0) {
sum += number%10;
number /= 10;
}
return sum;
}
void dfs(int x, int y, int threshold, int rows, int cols) {
if(vis[x][y] || getDigitSum(x)+getDigitSum(y) > threshold) return ;
vis[x][y] = true;
result++;
for(int i = 0; i<4; i++) {
int temx = x+dirx[i];
int temy = y+diry[i];
if(temx>=0 && temx<rows && temy>=0 && temy<cols) {
dfs(temx, temy, threshold, rows, cols);
}
}
}
public int movingCount(int threshold, int rows, int cols)
{
vis = new boolean[rows+1][cols+1];
dfs(0, 0, threshold, rows, cols);
return result;
}
}