题目链接:Minimum Number of Vertices to Reach All Nodes - LeetCode
解题思路:只需要找到所有入度为0的结点即可。
AC(Accept)代码:
class Solution {
public:
vector<int> findSmallestSetOfVertices(int n, vector<vector<int>>& edges) {
vector<int>visited(n, 0), res;
for(int i=0;i<edges.size();i++){
visited[edges[i][1]]=1;
}
for(int i=0;i<n;i++){
if(!visited[i]){
res.push_back(i);
}
}
return res;
}
};