coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 08:21:41 +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

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

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11.4K\", \"totalSubmission\": \"21.8K\", \"totalAcceptedRaw\": 11371, \"totalSubmissionRaw\": 21810, \"acRate\": \"52.1%\"}",
"stats": "{\"totalAccepted\": \"11.5K\", \"totalSubmission\": \"22.1K\", \"totalAcceptedRaw\": 11539, \"totalSubmissionRaw\": 22070, \"acRate\": \"52.3%\"}",
"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."