목록2024/08/30 (1)

넘치게 채우기

[LeetCode] 2699. Modify Graph Edge Weights

https://leetcode.com/problems/modify-graph-edge-weights/description/?envType=daily-question&envId=2024-08-30leetcode - Modift Graph Edge Weights문제 유형 : 우선순위 큐, 다익스트라, 최단거리문제 난이도 : Hard 문제You are given an undirected weighted connected graph containing n nodes labeled from 0 to n - 1, and an integer array edges where edges[i] = [ai, bi, wi] indicates that there is an edge between nodes ai and bi w..
PS/LeetCode 2024. 8. 30. 20:30
이전 Prev 1 Next 다음