coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 14:28:56 +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

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

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"20.6K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 20564, \"totalSubmissionRaw\": 45036, \"acRate\": \"45.7%\"}",
"stats": "{\"totalAccepted\": \"20.6K\", \"totalSubmission\": \"45K\", \"totalAcceptedRaw\": 20566, \"totalSubmissionRaw\": 45038, \"acRate\": \"45.7%\"}",
"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."