coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/least-number-of-unique-integers-after-k-removals.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1426,
"likes": 1427,
"dislikes": 140,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"108.1K\", \"totalSubmission\": \"193K\", \"totalAcceptedRaw\": 108097, \"totalSubmissionRaw\": 192974, \"acRate\": \"56.0%\"}",
"stats": "{\"totalAccepted\": \"108.1K\", \"totalSubmission\": \"193K\", \"totalAcceptedRaw\": 108100, \"totalSubmissionRaw\": 192978, \"acRate\": \"56.0%\"}",
"hints": [
"Use a map to count the frequencies of the numbers in the array.",
"An optimal strategy is to remove the numbers with the smallest count first."