classSolution:deffindTheCity(self,n:int,edges: List[List[int]],distanceThreshold:int) ->int:# 构建dist矩阵 dist = [[float('inf')] * n for _ inrange(n)]for i, j, w in edges: dist[i][j] = w dist[j][i] = wfor i inrange(n): dist[i][i] =0for k inrange(n):for i inrange(n):for j inrange(n): dist[i][j] =min(dist[i][j], dist[i][k] + dist[k][j])# 过滤 res =0 minCnt =float('inf')for i inrange(n): cnt =0for d in dist[i]:if d <= distanceThreshold: cnt +=1if cnt <= minCnt: minCnt = cnt res = ireturn res