面试题13. 机器人的运动范围( DFS / BFS ,清晰图解)
深度优先遍历
class Solution {
public:
int dfs(int i,int j,int si,int sj){
if(i<0||i>=m||j<0||j>=n||k<si+sj||visited[i][j]) return 0;
visited[i][j]=true;
return 1+dfs(i+1,j,(i+1)%10==0?si-8:si+1,sj)+dfs(i,j+1,si,(j+1)%10==0?sj-8:sj+1);
}
int movingCount(int m, int n, int k) {
this->m=m;this->n=n;this->k=k;
this->visited=vector<vector<bool>>(m,vector<bool>(n,false));
return dfs(0,0,0,0);
}
private:
int m,n,k;
vector<vector<bool>> visited;
};
广度优先遍历
class Solution {
public:
int movingCount(int m, int n, int k) {
vector<vector<bool>> visited(m,vector<bool>(n,false));
int res=0;
queue<vector<int>> q;
q.push(vector<int>{0,0,0,0});
while(q.size()>0){
vector<int> x=q.front();
q.pop();
int i=x[0],j=x[1],si=x[2],sj=x[3];
if(i<0||i>=m||j<0||j>=n||k<si+sj||visited[i][j]) continue;
visited[i][j]=true;
res++;
q.push(vector<int>{i+1,j,(i+1)%10==0?si-8:si+1,sj});
q.push(vector<int>{i,j+1,si,(j+1)%10==0?sj-8:sj+1});
}
return res;
}
};
一般思路
作者:diamond-28
链接:https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/solution/dfs-hui-su-di-gui-by-diamond-28/
class Solution {
public:
int nums = 0;
int movingCount(int m, int n, int k) {
vector<vector <int> > arr(m, vector<int>(n, 0));
if(k == 0)
return 1;
search(m, n, k, arr, 0, 0);
return nums;
}
void search(int m, int n, int k, vector<vector <int> >& arr, int i, int j){
if(i >= m || j >= n || i < 0 || j < 0)
return;
if(arr[i][j] == 1)
return;
if((i%10 + i/10 + j%10 + j/10) > k)
return;
arr[i][j] = 1;
nums++;
search(m, n, k, arr, i-1, j);
search(m, n, k, arr, i+1, j);
search(m, n, k, arr, i, j-1);
search(m, n, k, arr, i, j+1);
}
};