LeetCode Algorithm 1620. 網絡信号最好的坐标

Ideas

Code

Python

class Solution:
    def bestCoordinate(self, towers: List[List[int]], radius: int) -> List[int]:
        ans, max_quality = [0, 0], 0
        for i in range(51):
            for j in range(51):
                all_quality = 0
                for x, y, q in towers:
                    distance = ((x - i) ** 2 + (y - j) ** 2) ** 0.5
                    if distance <= radius:
                        all_quality += floor(q / (1 + distance))
                if all_quality > max_quality:
                    max_quality = all_quality
                    ans = [i, j]
        return ans