1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1070,
"dislikes": 175,
"likes": 1122,
"dislikes": 179,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Reorganize String\", \"titleSlug\": \"reorganize-string\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "1\n1\n7\n7\n1\n0",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"40.5K\", \"totalSubmission\": \"71.9K\", \"totalAcceptedRaw\": 40550, \"totalSubmissionRaw\": 71864, \"acRate\": \"56.4%\"}",
"stats": "{\"totalAccepted\": \"43.1K\", \"totalSubmission\": \"76.4K\", \"totalAcceptedRaw\": 43150, \"totalSubmissionRaw\": 76403, \"acRate\": \"56.5%\"}",
"hints": [
"Use a greedy approach.",
"Use the letter with the maximum current limit that can be added without breaking the condition."