mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"213.1K\", \"totalSubmission\": \"368.9K\", \"totalAcceptedRaw\": 213073, \"totalSubmissionRaw\": 368869, \"acRate\": \"57.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"213.1K\", \"totalSubmission\": \"368.9K\", \"totalAcceptedRaw\": 213112, \"totalSubmissionRaw\": 368932, \"acRate\": \"57.8%\"}",
|
||||
"hints": [
|
||||
"This problem is equivalent to finding the topological order in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.",
|
||||
"<a href=\"https://class.coursera.org/algo-003/lecture/52\" target=\"_blank\">Topological Sort via DFS</a> - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.",
|
||||
|
Reference in New Issue
Block a user