mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 1095,
|
||||
"likes": 1097,
|
||||
"dislikes": 24,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Find All Lonely Numbers in the Array\", \"titleSlug\": \"find-all-lonely-numbers-in-the-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -167,7 +167,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"19.8K\", \"totalSubmission\": \"54.3K\", \"totalAcceptedRaw\": 19807, \"totalSubmissionRaw\": 54323, \"acRate\": \"36.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"19.9K\", \"totalSubmission\": \"54.5K\", \"totalAcceptedRaw\": 19875, \"totalSubmissionRaw\": 54485, \"acRate\": \"36.5%\"}",
|
||||
"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"
|
||||
|
Reference in New Issue
Block a user