机器人的运动范围
题目描述
地上有一个 m
行和 n
列的方格。一个机器人从坐标 (0,0)
的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当 k
为 18
时,机器人能够进入方格 (35,37)
,因为 3+5+3+7 = 18
。但是,它不能进入方格(35,38)
,因为 3+5+3+8 = 19
。请问该机器人能够达到多少个格子?
回溯
class Solution {
static int rows;
static int cols;
static boolean[][] visited;
public int movingCount(int threshold, int rows, int cols) {
this.rows = rows;
this.cols = cols;
visited = new boolean[rows][cols];
return dfs(threshold, 0, 0);
}
private int dfs(int k, int r, int c) {
if (r < 0 || r >= rows || c < 0 || c >= cols || visited[r][c] || digitSum(r) + digitSum(c) > k)
return 0;
visited[r][c] = true;
return 1 + dfs(k, r - 1, c)
+ dfs(k, r, c + 1)
+ dfs(k, r + 1, c)
+ dfs(k, r, c - 1);
}
private int digitSum(int num) {
int sum = 0;
while (num > 0) {
sum += num % 10;
num = num / 10;
}
return sum;
}
}
bfs
class Solution {
class Pair {
int x;
int y;
public Pair(int x, int y) {
this.x = x;
this.y = y;
}
}
static int rows;
static int cols;
static boolean[][] visited;
public int movingCount(int threshold, int rows, int cols) {
if (rows <= 0 || cols <= 0)
return 0;
this.rows = rows;
this.cols = cols;
visited = new boolean[rows][cols];
return bfs(threshold, 0, 0);
}
private int bfs(int k, int i, int j) {
Queue<Pair> q = new LinkedList<>();
int[] dx = {-1, 0, 1, 0}, dy = {0, 1, 0, -1};
int res = 0;
q.add(new Pair(i, j));
while (!q.isEmpty()) {
Pair temp = q.remove();
int r = temp.x, c = temp.y;
// 已经访问过该位置,或者坐标和不满足要求
if (visited[r][c] || (digitSum(r) + digitSum(c) > k))
continue;
++res;
visited[r][c] = true;
for (int dir = 0; dir < 4; ++dir) {
int x = r + dx[dir], y = c + dy[dir];
if (x >= 0 && x < rows && y >= 0 && y < cols)
q.add(new Pair(x, y));
}
}
return res;
}
private int digitSum(int num) {
int sum = 0;
while (num > 0) {
sum += num % 10;
num = num / 10;
}
return sum;
}
}