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,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1210,
"likes": 1285,
"dislikes": 27,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Minimum Deletions to Make Array Beautiful\", \"titleSlug\": \"minimum-deletions-to-make-array-beautiful\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Removing Minimum and Maximum From Array\", \"titleSlug\": \"removing-minimum-and-maximum-from-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"78.2K\", \"totalSubmission\": \"138.7K\", \"totalAcceptedRaw\": 78200, \"totalSubmissionRaw\": 138670, \"acRate\": \"56.4%\"}",
"stats": "{\"totalAccepted\": \"82.2K\", \"totalSubmission\": \"145.7K\", \"totalAcceptedRaw\": 82218, \"totalSubmissionRaw\": 145665, \"acRate\": \"56.4%\"}",
"hints": [
"As we can only delete characters, if we have multiple characters having the same frequency, we must decrease all the frequencies of them, except one.",
"Sort the alphabet characters by their frequencies non-increasingly.",