1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 4141,
"likes": 4143,
"dislikes": 148,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Find All Lonely Numbers in the Array\", \"titleSlug\": \"find-all-lonely-numbers-in-the-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Longest Nice Subarray\", \"titleSlug\": \"longest-nice-subarray\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"118.4K\", \"totalSubmission\": \"253.9K\", \"totalAcceptedRaw\": 118372, \"totalSubmissionRaw\": 253940, \"acRate\": \"46.6%\"}",
"stats": "{\"totalAccepted\": \"118.4K\", \"totalSubmission\": \"254K\", \"totalAcceptedRaw\": 118404, \"totalSubmissionRaw\": 254023, \"acRate\": \"46.6%\"}",
"hints": [
"Note that you can try all values in a brute force manner and find the maximum frequency of that value.",
"To find the maximum frequency of a value consider the biggest elements smaller than or equal to this value"