13:T4f7,class Solution { public: vector remainingMethods(int n, int k, vector>& invocations) { vector> edges(n); vector in_degree(n, 0); for (const auto& inv : invocations) { edges[inv[0]].push_back(inv[1]); in_degree[inv[1]]++; } queue q; q.push(k); vector suspicious(n, false); suspicious[k] = true; while (!q.empty()) { int u = q.front(); q.pop(); for (int v : edges[u]) { in_degree[v]--; if (!suspicious[v]) { suspicious[v] = true; q.push(v); } } } bool can_remove_all = true; for (int i = 0; i < n; i++) { if (suspicious[i] && in_degree[i] > 0) { can_remove_all = false; break; } } vector ans; if (can_remove_all) { for (int i = 0; i < n; i++) { if (!suspicious[i]) ans.push_back(i); } } else { for (int i = 0; i < n; i++) ans.push_back(i); } return ans; } };14:T48b,/** * @param {number} n * @param {number} k * @param {number[][]} invocations * @return {number[]} */ var remainingMethods = function(n, k, invocations) { const edges = Array.from({ length: n }, () => []); const inDegree = new Array(n).fill(0); for (const [u, v] of invocations) { edges[u].push(v); inDegree[v]++; } const queue = [k]; const suspicious = new Uint8Array(n); suspicious[k] = 1; let head = 0; while (head < queue.length) { const u = queue[head++]; for (const v of edges[u]) { inDegree[v]--; if (suspicious[v] === 0) { suspicious[v] = 1; queue.push(v); } } } let canRemoveAll = true; for (let i = 0; i < n; i++) { if (suspicious[i] === 1 && inDegree[i] > 0) { canRemoveAll = false; break; } } const ans = []; if (canRemoveAll) { for (let i = 0; i < n; i++) { if (suspicious[i] === 0) ans.push(i); } } else { for (let i = 0; i < n; i++) ans.push(i); } return ans; };

Time Complexity

Space Complexity