mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 286,
|
||||
"likes": 291,
|
||||
"dislikes": 16,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Maximum Points You Can Obtain from Cards\", \"titleSlug\": \"maximum-points-you-can-obtain-from-cards\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Minimum Deletions to Make Character Frequencies Unique\", \"titleSlug\": \"minimum-deletions-to-make-character-frequencies-unique\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"26.8K\", \"totalAcceptedRaw\": 15482, \"totalSubmissionRaw\": 26778, \"acRate\": \"57.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"15.6K\", \"totalSubmission\": \"26.9K\", \"totalAcceptedRaw\": 15578, \"totalSubmissionRaw\": 26939, \"acRate\": \"57.8%\"}",
|
||||
"hints": [
|
||||
"There can only be three scenarios for deletions such that both minimum and maximum elements are removed:",
|
||||
"Scenario 1: Both elements are removed by only deleting from the front.",
|
||||
|
Reference in New Issue
Block a user