[leetcode] 1620. Coordinate With Maximum Network Quality

Description

You are given an array of network towers towers and an integer radius, where towers[i] = [xi, yi, qi] denotes the ith network tower with location (xi, yi) and quality factor qi. All the coordinates are integral coordinates on the X-Y plane, and the distance between two coordinates is the Euclidean distance.

The integer radius denotes the maximum distance in which the tower is reachable. The tower is reachable if the distance is less than or equal to radius. Outside that distance, the signal becomes garbled, and the tower is not reachable.

The signal quality of the ith tower at a coordinate (x, y) is calculated with the formula ⌊qi / (1 + d)⌋, where d is the distance between the tower and the coordinate. The network quality at a coordinate is the sum of the signal qualities from all the reachable towers.

Return the integral coordinate where the network quality is maximum. If there are multiple coordinates with the same network quality, return the lexicographically minimum coordinate.

Note:

• A coordinate (x1, y1) is lexicographically smaller than (x2, y2) if either x1 < x2 or x1 == x2 and y1 < y2.
• ⌊val⌋ is the greatest integer less than or equal to val (the floor function).

Example 1:

Input: towers = [[1,2,5],[2,1,7],[3,1,9]], radius = 2
Output: [2,1]
Explanation: 
At coordinate (2, 1) the total quality is 13
- Quality of 7 from (2, 1) results in ⌊7 / (1 + sqrt(0)⌋ = ⌊7⌋ = 7
- Quality of 5 from (1, 2) results in ⌊5 / (1 + sqrt(2)⌋ = ⌊2.07⌋ = 2
- Quality of 9 from (3, 1) results in ⌊9 / (1 + sqrt(1)⌋ = ⌊4.5⌋ = 4
No other coordinate has higher quality.

Example 2:

Input: towers = [[23,11,21]], radius = 9
Output: [23,11]

Example 3:

Input: towers = [[1,2,13],[2,1,7],[0,1,9]], radius = 2
Output: [1,2]

Example 4:

Input: towers = [[2,1,9],[0,1,9]], radius = 2
Output: [0,1]
Explanation: Both (0, 1) and (2, 1) are optimal in terms of quality but (0, 1) is lexicograpically minimal.

Constraints:

• 1 <= towers.length <= 50
• towers[i].length == 3
• 0 <= xi, yi, qi <= 50
• 1 <= radius <= 50

分析

题目的意思是：给定towers数组，每一项包含坐标点的位置和q值，求一个中心坐标位置，使得求的的q的总和最大。

• 思路很直接，坐标的每个点都遍历一遍，找出能使的q最大的q值。
• 这里注意res初始化为[0,0]，表示默认选择的是坐标原点。

代码

class Solution:
    def bestCoordinate(self, towers: List[List[int]], radius: int) -> List[int]:
        n=50
        res=[0,0]
        max_q=0
        for i in range(n+1):
            for j in range(n+1):
                q=0
                for tower in towers:
                    tx=tower[0]
                    ty=tower[1]
                    d=sqrt((i-tx)**2+(j-ty)**2)
                    if(d>radius):
                        continue
                    q+=math.floor(tower[2]/(1+d))
                if(q>max_q):
                    max_q=q
                    res=[i,j]
        return res

参考文献

花花酱 LeetCode 1620. Coordinate With Maximum Network Quality