1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +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,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Medium",
"likes": 181,
"dislikes": 9,
"likes": 182,
"dislikes": 10,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "\"parker\"\n\"morris\"\n\"parser\"\n\"hello\"\n\"world\"\n\"hold\"\n\"leetcode\"\n\"programs\"\n\"sourcecode\"",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 7296, \"totalSubmissionRaw\": 10573, \"acRate\": \"69.0%\"}",
"stats": "{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 7325, \"totalSubmissionRaw\": 10604, \"acRate\": \"69.1%\"}",
"hints": [
"Model these equalities as edges of a graph.",
"Group each connected component of the graph and assign each node of this component to the node with the lowest lexicographically character.",