2101. 引爆最多的炸弹

Python ml

于 2024-08-17 00:30:41 发布

阅读量22

点赞数 1

分类专栏： LeetCode 文章标签： python

本文链接：https://blog.csdn.net/m0_48711099/article/details/141272472

版权

LeetCode 专栏收录该内容

174 篇文章 0 订阅

订阅专栏

class Solution:
    def maximumDetonation(self, bombs: List[List[int]]) -> int:
        def distance(a, b):
            return pow((a[0] - b[0])**2 + (a[1] - b[1])**2, 0.5)
        g = defaultdict(list)
        for i, (x1, y1, r1) in enumerate(bombs):
            for j, (x2, y2, r2) in enumerate(bombs):
                if i == j:continue
                dis = distance((x1, y1), (x2, y2))
                if dis <= r1:
                    g[i].append(j)
                if dis <= r2:
                    g[j].append(i)


        def dfs(i):
            cnt = 1
            vis[i] = True
            for j in g[i]:
                if not vis[j]:
                    cnt += dfs(j)
            return cnt

        res = 0
        n = len(bombs)
        for i in range(n):
            vis = [False] * n
            res = max(res, dfs(i))
        return res