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": 265,
|
||||
"likes": 266,
|
||||
"dislikes": 17,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"30.7K\", \"totalAcceptedRaw\": 13257, \"totalSubmissionRaw\": 30732, \"acRate\": \"43.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"13.3K\", \"totalSubmission\": \"30.8K\", \"totalAcceptedRaw\": 13278, \"totalSubmissionRaw\": 30777, \"acRate\": \"43.1%\"}",
|
||||
"hints": [
|
||||
"If both ends have distinct characters, no more operations can be made. Otherwise, the only operation is to remove all of the same characters from both ends. We will do this as many times as we can.",
|
||||
"Note that if the length is equal 1 the answer is 1"
|
||||
|
Reference in New Issue
Block a user