목록2024/06/30 (1)

넘치게 채우기

[LeetCode] 1579. Remove Max Number of Edges to Keep Graph Fully Traversable

https://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/description/leetcode - Remove Max Number of Edes to Keep Graph Fully Traversable문제 유형 : 유니온-파인드, 그리디문제 난이도 : Hard 문제Alice and Bob have an undirected graph of n nodes and three types of edges:Type 1: Can be traversed by Alice only.Type 2: Can be traversed by Bob only.Type 3: Can be traversed by both Alice and..
PS/LeetCode 2024. 6. 30. 15:48
이전 Prev 1 Next 다음