4/8 leetcode 每日一题面试题13. 机器人的运动范围

最新推荐文章于 2023-03-11 14:31:19 发布

kukufufu

最新推荐文章于 2023-03-11 14:31:19 发布

阅读量195

点赞数

分类专栏：刷题 C++

本文链接：https://blog.csdn.net/weixin_39712314/article/details/105396305

版权

刷题同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

C++

16 篇文章 0 订阅

订阅专栏

思路

代码c++

思路1： DFS

class Solution {
public:
    int movingCount(int m, int n, int k) {
        vector<vector<bool>> visited(m,vector<bool>(n, false)); //visited数组
        return DFS(0 ,0, m, n, visited, k);
    }

    int DFS(int i, int j, int m, int n, vector<vector<bool>>& visited, int k){
        if(i >= m || j >= n || i < 0 || j < 0 || visited[i][j] == true){
            return 0;
        }
        if(i % 10 + j % 10 + i / 10 + j / 10 > k){
            return 0;
        }
        visited[i][j] = true;
        return 1 + DFS(i, j+1, m, n, visited, k) + DFS(i+1, j, m, n, visited, k); // 1 + 右 + 下
    }
};

思路2： BFS

class Solution {
public:
    vector<pair<int, int>> directions = {{0, 1}, {1, 0}};
    
    int movingCount(int m, int n, int k) {
        vector<vector<bool>> visited(m,vector<bool>(n, false)); //visited数组
        queue<pair<int, int>> q;// i,j
        q.push({0,0});
        int res = 0;

        while(!q.empty()){
            auto cur = q.front();
            q.pop();

            int i = cur.first;
            int j = cur.second;
            
            if(visited[i][j] == true){
                continue;
            }
            res++;
            visited[i][j] = true;
            for(auto d : directions){
                int ii = i + d.first;
                int jj = j + d.second;
                if(ii >= m || jj >= n || visited[ii][jj] == true || ii % 10 + jj % 10 + ii / 10 + jj / 10 > k){
                    continue;
                }
                q.push({ii, jj});
            }
        }
        return res;
    }
};