목록Find the City With the Smallest Number of Neighbors at a Threshold Distance (1)

Scribbling

LeetCode: 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance

class Solution: def findTheCity(self, n: int, edges: List[List[int]], distanceThreshold: int) -> int: INF = int(1e9) distance = [[INF] * (n) for _ in range(n)] for i in range(n): distance[i][i] = 0 for edge in edges: u = edge[0] v = edge[1] w = edge[2] distance[u][v] = w distance[v][u] = w for k in range(n): for a in range(n): for b in range(n): distance[a][b] = min(distance[a][b], distance[a][k..
Computer Science/Coding Test 2021. 8. 10. 21:57
이전 Prev 1 Next 다음