1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 754,
"likes": 756,
"dislikes": 46,
"isLiked": null,
"similarQuestions": "[]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"30K\", \"totalSubmission\": \"62.9K\", \"totalAcceptedRaw\": 30007, \"totalSubmissionRaw\": 62889, \"acRate\": \"47.7%\"}",
"stats": "{\"totalAccepted\": \"30.1K\", \"totalSubmission\": \"63K\", \"totalAcceptedRaw\": 30058, \"totalSubmissionRaw\": 62997, \"acRate\": \"47.7%\"}",
"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.",