mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 176,
|
||||
"likes": 177,
|
||||
"dislikes": 48,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Minimum Insertion Steps to Make a String Palindrome\", \"titleSlug\": \"minimum-insertion-steps-to-make-a-string-palindrome\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 4351, \"totalSubmissionRaw\": 10630, \"acRate\": \"40.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"10.7K\", \"totalAcceptedRaw\": 4379, \"totalSubmissionRaw\": 10671, \"acRate\": \"41.0%\"}",
|
||||
"hints": [
|
||||
"Consider a greedy strategy.",
|
||||
"Let’s start by making the leftmost and rightmost characters match with some number of swaps.",
|
||||
|
Reference in New Issue
Block a user