Leetcode—2101. 引爆最多的炸弹【中等】

2024每日刷题（146）

Leetcode—2101. 引爆最多的炸弹

实现代码

typedef long long LL;

class Solution {
public:
    int maximumDetonation(vector<vector<int>>& bombs) {
        int n = bombs.size();
        unordered_map<int, vector<int>> adj;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                if(i == j) {
                    continue;
                }
                LL x1 = bombs[i][0];
                LL y1 = bombs[i][1];
                LL r1 = bombs[i][2];

                LL x2 = bombs[j][0];
                LL y2 = bombs[j][1];
                LL r2 = bombs[j][2];

                LL distance = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
                if(r1 * r1 >= distance) {
                    adj[i].push_back(j);
                }
            }
        }
        unordered_set<int> visited;

        function<void(int)> dfs = [&](int u) {
            visited.insert(u);
            for(int &v: adj[u]) {
                if(visited.find(v) == visited.end()) {
                    dfs(v);
                }
            }
        };

        int res = 0;
        for(int i = 0; i < n; i++) {
            dfs(i);
            int count = visited.size();
            res = max(count, res);
            visited.clear();
        }

        return res;
    }
};

运行结果

之后我会持续更新，如果喜欢我的文章，请记得一键三连哦，点赞关注收藏，你的每一个赞每一份关注每一次收藏都将是我前进路上的无限动力 ！！！↖(▔▽▔)↗感谢支持！