2022-11-2 Matrix每日一题3道全集

第一题判断字符串是否相等

leetcode 1662

不难

求解最小公倍数

最小公倍数为 a*b/最小公约数

然后最小公约数的求法就可以有两种，一个九章算术的等值法，一个欧几里得算法（我选择等值法）

 然后最后一题

leetcode 1620

暴力枚举，hashmap小小优化一下

class Solution:
    def bestCoordinate(self, towers: List[List[int]], radius: int) -> List[int]:
        board = []
        for i in range(51):
            board.append([0 for j in range(51)])
        for tower in towers:
            x,y,q = tower
            for i in range(2*radius+1):
                m = x-radius+i
                if m<0 or m>50:
                    continue
                for j in range(2*radius+1):
                    n = y-radius+j
                    if n<0 or n>50:
                        continue
                    
                    dis = sqrt((m-x)**2+(n-y)**2)
                    if dis<=radius:
                        board[m][n]+= int(q/(1+dis))
        maxx = -1
        res=[]
        for i in range(51):
            for j in range(51):
                if maxx < board[i][j]:
                    res = [i,j]
                    maxx=board[i][j]
        return res