LeetCode 1557 Minimum Number of Vertices to Reach All Nodes

1557 Minimum Number of Vertices to Reach All Nodes

https://leetcode.com/problems/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 node fromi to node toi.

Find the smallest set of vertices from which all nodes in the graph are reachable. It’s guaranteed that a unique solution exists.

Notice that you can return the vertices in any order.

Example 1:

Input: n = 6, edges = [[0,1],[0,2],[2,5],[3,4],[4,2]]
Output: [0,3]
Explanation: It's not possible to reach all the nodes from a single vertex. From 0 we can reach [0,1,2,5]. From 3 we can reach [3,4,2,5]. So we output [0,3].

Example 2:

Input: n = 5, edges = [[0,1],[2,1],[3,1],[1,4],[2,4]]
Output: [0,2,3]
Explanation: Notice that vertices 0, 3 and 2 are not reachable from any other node, so we must include them. Also any of these vertices can reach nodes 1 and 4.

Constraints:

• 2 <= n <= 10^5
• 1 <= edges.length <= min(10^5, n * (n - 1) / 2)
• edges[i].length == 2
• 0 <= fromi, toi < n
• All pairs (fromi, toi) are distinct.

basic solution

在有向无环图中寻求最小的点集，使得通过该集合可以到达图中所有的点，即找到入度为 0 的点。直接的思路是遍历边表，用一个数组记录有入度的点，再次遍历该数组，将其余的点作为结果数组返回。

时间复杂度 O(m+n)，空间复杂度 O(n)

class Solution {
public:
    vector<int> findSmallestSetOfVertices(int n, vector<vector<int>>& edges) {
        vector<int> v(n, 1), res;
        for(auto i : edges){
            v[i[1]] = 0;
        }
        for(int i = 0; i < n; ++i){
            if(v[i] == 1)   res.push_back(i);
        }
        return res;
    }
};

Runtime: 364 ms, faster than 60.71% of C++ online submissions for Minimum Number of Vertices to Reach All Nodes.

Memory Usage: 106.7 MB, less than 36.91% of C++ online submissions for Minimum Number of Vertices to Reach All Nodes.

optimization 1

更换入度的标志，数组默认赋值 0，有入度的再更改为 1，运行速度有所提升。

class Solution {
public:
    vector<int> findSmallestSetOfVertices(int n, vector<vector<int>>& edges) {
        vector<int> v(n), res;
        for(auto& i : edges)    v[i[1]] = 1;
        for(int i = 0; i < n; ++i){
            if(v[i] == 0)   res.push_back(i);
        }
        return res;
    }
};

Runtime: 312 ms, faster than 70.73% of C++ online submissions for Minimum Number of Vertices to Reach All Nodes.

Memory Usage: 94.4 MB, less than 70.15% of C++ online submissions for Minimum Number of Vertices to Reach All Nodes.