mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-03 14:32:54 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 481,
|
||||
"dislikes": 48,
|
||||
"likes": 525,
|
||||
"dislikes": 50,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[1,7,5]\n[2,3,5]\n[2,4,6,8,10]\n[2,4,6,8,10]\n[1,10,4,4,2,7]\n[9,3,5,1,7,4]",
|
||||
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"45.6K\", \"totalAcceptedRaw\": 13173, \"totalSubmissionRaw\": 45598, \"acRate\": \"28.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"14K\", \"totalSubmission\": \"47.7K\", \"totalAcceptedRaw\": 13955, \"totalSubmissionRaw\": 47734, \"acRate\": \"29.2%\"}",
|
||||
"hints": [
|
||||
"Go through each element and test the optimal replacements.",
|
||||
"There are only 2 possible replacements for each element (higher and lower) that are optimal."
|
||||
|
Reference in New Issue
Block a user