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\": \"358.4K\", \"totalSubmission\": \"665.5K\", \"totalAcceptedRaw\": 358410, \"totalSubmissionRaw\": 665468, \"acRate\": \"53.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"358.5K\", \"totalSubmission\": \"665.6K\", \"totalAcceptedRaw\": 358482, \"totalSubmissionRaw\": 665608, \"acRate\": \"53.9%\"}",
|
||||
"hints": [
|
||||
"This problem is equivalent to finding if a cycle exists 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://www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/03Graphs.pdf\" target=\"_blank\">Topological Sort via DFS</a> - A great tutorial explaining the basic concepts of Topological Sort.",
|
||||
|
Reference in New Issue
Block a user