题目:
地上有一个m行和n列的方格。一个机器人从坐标0,0的格子开始移动,每一次只能向左,右,上,下四个方向移动一格,但是不能进入行坐标和列坐标的数位之和大于k的格子。 例如,当k为18时,机器人能够进入方格(35,37),因为3+5+3+7 = 18。但是,它不能进入方格(35,38),因为3+5+3+8 = 19。请问该机器人能够达到多少个格子?
思路:
BFS算法,每次判断到达的新位置能不能进入就行。
struct Node{
int x;
int y;
Node(int m,int n):x(m),y(n){};
};
class Solution {
public:
int f(int nx,int ny,int threshold){
int a = nx, b = ny, s1 = 0, s2 = 0;
while(a) {
s1 += a%10;
a = a/10;
}
while(b) {
s2 += b%10;
b = b/10;
}
int t = s1 + s2;
return t <= threshold?1:0;
}
int BFS(int rows, int cols,int threshold){
queue<Node> road;
int count = 1;
if(threshold<0) return 0;
int next[4][2]={0,1,0,-1,1,0,-1,0};
int flag[100][100] = {0};
flag[0][0] = 1;
road.push( Node(0,0));
while(!road.empty()) {
Node t = road.front();
road.pop();
for(int i = 0; i < 4; i++) {
int nx = t.x+next[i][0];
int ny = t.y+next[i][1];
if(nx<0||nx>=rows||ny<0||ny>=cols) {
continue;
} else {
if(flag[nx][ny] ==0&&f(nx,ny,threshold)) {
count++;
flag[nx][ny] = 1;
road.push( Node(nx,ny));
}
}
}
}
return count;
}
int movingCount(int threshold, int rows, int cols){
return BFS(rows,cols,threshold);
}
};