coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21: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/reduce-array-size-to-the-half.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1206,
"dislikes": 82,
"likes": 1240,
"dislikes": 84,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[3,3,3,3,5,5,5,2,2,7]\n[7,7,7,7,7,7]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"82.2K\", \"totalSubmission\": \"120.2K\", \"totalAcceptedRaw\": 82243, \"totalSubmissionRaw\": 120203, \"acRate\": \"68.4%\"}",
"stats": "{\"totalAccepted\": \"83.6K\", \"totalSubmission\": \"122.2K\", \"totalAcceptedRaw\": 83595, \"totalSubmissionRaw\": 122213, \"acRate\": \"68.4%\"}",
"hints": [
"Count the frequency of each integer in the array.",
"Start with an empty set, add to the set the integer with the maximum frequency.",