add 210

Author: luliyucoordinate

README.md

@@ -188,6 +188,7 @@ LeetCode
 |0207|[Course Schedule](https://leetcode.com/problems/course-schedule/) | c | [c++](./src/0207-Course-Schedule/0207.cpp) |[python](./src/0207-Course-Schedule/0207.py)|[go](./src/0207-Course-Schedule/0207.go)|[js](./src/0207-Course-Schedule/0207.js)|Medium|
 |0208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | c | [c++](./src/0208-Implement-Trie-(Prefix-Tree)/0208.cpp) |[python](./src/0208-Implement-Trie-(Prefix-Tree)/0208.py)|||Easy|
 |0209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | c | [c++](./src/0209-Minimum-Size-Subarray-Sum/0209.cpp) |[python](./src/0209-Minimum-Size-Subarray-Sum/0209.py)|||Medium|
+|0210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | c | [c++](./src/0210-Course-Schedule-II/0210.cpp) |[python](./src/0210-Course-Schedule-II/0210.py)|[go](./src/0210-Course-Schedule-II/0210.go)|[js](./src/0210-Course-Schedule-II/0210.js)|Medium|
 |0211|[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/) | c | [c++](./src/0211-Add-and-Search-Word-Data-structure-design/0211.cpp) |[python](./src/0211-Add-and-Search-Word-Data-structure-design/0211.py)|||Medium|
 |0213|[House Robber II](https://leetcode.com/problems/house-robber-ii/) | c | [c++](./src/0213-House-Robber-II/0213.cpp) |[python](./src/0213-House-Robber-II/0213.py)|||Medium|
 |0215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | c | [c++](./src/0215-Kth-Largest-Element-in-an-Array/0215.cpp) |[python](./src/0215-Kth-Largest-Element-in-an-Array/0215.py)|||Medium|

src/0210-Course-Schedule-II/0210.cpp

@@ -0,0 +1,40 @@
+class Solution 
+{
+public:
+    vector<int> findOrder(int n, vector<vector<int>>& prerequisites) 
+    {
+        unordered_map<int, vector<int>> g;
+        vector<int> d(n), vis(n), res;
+        for (auto& it : prerequisites)
+        {
+            g[it[1]].push_back(it[0]); 
+            d[it[0]]++;
+        }
+        
+        queue<int> q;
+        for (int i = 0; i < n; i++)
+        {
+            if (d[i] == 0)
+            {
+                q.push(i);
+                vis[i] = 1;
+            }
+        }
+        while (!q.empty())
+        {
+            auto cur = q.front(); q.pop();
+            res.push_back(cur);
+            n--;
+            for (int i : g[cur])
+            {
+                d[i]--;
+                if (!vis[i] and d[i] == 0)
+                {
+                    vis[i] = 1;
+                    q.push(i);
+                }
+            }
+        }
+        return n == 0 ? res : vector<int>();
+    }
+};

src/0210-Course-Schedule-II/0210.go

@@ -0,0 +1,32 @@
+var findOrder = function(n, prerequisites) {
+    let g = new Map();
+    let d = new Array(n), vis = new Array(n), res = [], q = [];
+    d.fill(0); vis.fill(0);
+    for (let it of prerequisites) {
+        if (g.has(it[1]))
+            g.get(it[1]).push(it[0]);
+        else g.set(it[1], [it[0]]);
+        d[it[0]]++;
+    }
+    
+    for (let i = 0; i < n; i++) {
+        if (d[i] == 0) {
+            q.push(i);
+            vis[i] = 1;
+        }
+    }
+    
+    while (q.length) {
+        let cur = q.shift();
+        res.push(cur);
+        n--;
+        for (let i of g.get(cur) || []) {
+            d[i]--;
+            if (!vis[i] && d[i] == 0) {
+                vis[i] = 1;
+                q.push(i);
+            }
+        }
+    }
+    return n == 0 ? res : [];
+};

src/0210-Course-Schedule-II/0210.js

@@ -0,0 +1,23 @@
+class Solution:
+    def findOrder(self, n: int, prerequisites: List[List[int]]) -> List[int]:
+        g = collections.defaultdict(list)
+        d, vis, q, res = [0] * n, [0] * n, [], []
+        for i, j in prerequisites:
+            g[j].append(i)
+            d[i] += 1
+            
+        for i in range(n):
+            if d[i] == 0:
+                q.append(i)
+                vis[i] = 1
+        
+        while q:
+            cur = q.pop(0)
+            res.append(cur)
+            n -= 1
+            for i in g[cur]:
+                d[i] -= 1
+                if not vis[i] and d[i] == 0:
+                    vis[i] = 1
+                    q.append(i)
+        return res if n == 0 else []