1
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
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 122,
"dislikes": 1,
"likes": 166,
"dislikes": 5,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Sort Array by Increasing Frequency\", \"titleSlug\": \"sort-array-by-increasing-frequency\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[3,2,3,2,2,2]\n[1,2,3,4]",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.9K\", \"totalSubmission\": \"20.4K\", \"totalAcceptedRaw\": 15908, \"totalSubmissionRaw\": 20379, \"acRate\": \"78.1%\"}",
"stats": "{\"totalAccepted\": \"20.7K\", \"totalSubmission\": \"26.7K\", \"totalAcceptedRaw\": 20677, \"totalSubmissionRaw\": 26709, \"acRate\": \"77.4%\"}",
"hints": [
"For any number x in the range [1, 500], count the number of elements in nums whose values are equal to x.",
"The elements with equal value can be divided completely into pairs if and only if their count is even."