1
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
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": 1917,
"dislikes": 1272,
"likes": 1964,
"dislikes": 1294,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximum Subarray\", \"titleSlug\": \"maximum-subarray\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,2,3,1]\n[1,2,2,3,1,4,2]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"145.7K\", \"totalSubmission\": \"262K\", \"totalAcceptedRaw\": 145681, \"totalSubmissionRaw\": 262012, \"acRate\": \"55.6%\"}",
"stats": "{\"totalAccepted\": \"148.3K\", \"totalSubmission\": \"266.5K\", \"totalAcceptedRaw\": 148284, \"totalSubmissionRaw\": 266543, \"acRate\": \"55.6%\"}",
"hints": [
"Say 5 is the only element that occurs the most number of times - for example, nums = [1, 5, 2, 3, 5, 4, 5, 6]. What is the answer?"
],