2023.03.22 Today's Challenge

https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/

Minimum Score of a Path Between Two Cities - LeetCode

BFS로 풀면 되는 문제

class Solution:
    def minScore(self, n: int, roads: List[List[int]]) -> int:
        g = defaultdict(dict)
        for u, v, w in roads:
            g[u][v] = g[v][u] = w
        
        ms = float('inf')
        visited = set()
        qu = deque([1])

        while qu:
            node = qu.popleft()
            for adj, score in g[node].items():
                if adj not in visited:
                    qu.append(adj)
                    visited.add(adj)
                ms = min(ms, score)
        
        return ms