파비의 매일매일 공부기록

2023.05.18 Today's Challenge 본문

Problem Solving/LeetCode

2023.05.18 Today's Challenge

fabichoi 2023. 5. 18. 23:45

https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/

 

Minimum Number of Vertices to Reach All Nodes - LeetCode

Can you solve this real interview question? Minimum Number of Vertices to Reach All Nodes - Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from

leetcode.com

class Solution:
    def findSmallestSetOfVertices(self, n: int, edges: List[List[int]]) -> List[int]:
        a = set(range(n))
        d = set(d for _, d in edges)
        s = a - d
        return list(s)
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

2023.05.20 Today's Challenge  (0) 2023.05.20
2023.05.19 Today's Challenge  (0) 2023.05.19
2023.05.17 Today's Challenge  (0) 2023.05.17
2023.05.16 Today's Challenge  (0) 2023.05.16
2023.05.15 Today's Challenge  (1) 2023.05.15
'Problem Solving/LeetCode' Related Articles more
Comments