mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Medium",
|
||||
"likes": 43,
|
||||
"likes": 46,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -34,7 +34,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"6.6K\", \"totalAcceptedRaw\": 3880, \"totalSubmissionRaw\": 6618, \"acRate\": \"58.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"7K\", \"totalAcceptedRaw\": 4147, \"totalSubmissionRaw\": 7034, \"acRate\": \"59.0%\"}",
|
||||
"hints": [
|
||||
"Try to think of it as a graph problem. It will be impossible to study all the courses if the graph had a cycle.",
|
||||
"The graph is a directed acyclic graph (DAG). The answer is the longes path in this DAG.",
|
||||
|
Reference in New Issue
Block a user