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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 850,
"dislikes": 63,
"likes": 877,
"dislikes": 64,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[5,5,4]\n1\n[4,3,1,1,3,3,2]\n3",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"67.9K\", \"totalSubmission\": \"112.8K\", \"totalAcceptedRaw\": 67866, \"totalSubmissionRaw\": 112847, \"acRate\": \"60.1%\"}",
"stats": "{\"totalAccepted\": \"69.4K\", \"totalSubmission\": \"115.3K\", \"totalAcceptedRaw\": 69442, \"totalSubmissionRaw\": 115261, \"acRate\": \"60.2%\"}",
"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."