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-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 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": 849,
"likes": 850,
"dislikes": 63,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"67.7K\", \"totalSubmission\": \"112.6K\", \"totalAcceptedRaw\": 67697, \"totalSubmissionRaw\": 112583, \"acRate\": \"60.1%\"}",
"stats": "{\"totalAccepted\": \"67.9K\", \"totalSubmission\": \"112.8K\", \"totalAcceptedRaw\": 67866, \"totalSubmissionRaw\": 112847, \"acRate\": \"60.1%\"}",
"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."