mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 756,
|
||||
"likes": 778,
|
||||
"dislikes": 46,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"63K\", \"totalAcceptedRaw\": 30058, \"totalSubmissionRaw\": 62997, \"acRate\": \"47.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"30.8K\", \"totalSubmission\": \"64.4K\", \"totalAcceptedRaw\": 30821, \"totalSubmissionRaw\": 64403, \"acRate\": \"47.9%\"}",
|
||||
"hints": [
|
||||
"Imagine if the courses are nodes of a graph. We need to build an array isReachable[i][j].",
|
||||
"Start a bfs from each course i and assign for each course j you visit isReachable[i][j] = True.",
|
||||
|
Reference in New Issue
Block a user