mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 228,
|
||||
"likes": 240,
|
||||
"dislikes": 41,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"48.5K\", \"totalAcceptedRaw\": 17311, \"totalSubmissionRaw\": 48466, \"acRate\": \"35.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"17.8K\", \"totalSubmission\": \"49.7K\", \"totalAcceptedRaw\": 17791, \"totalSubmissionRaw\": 49665, \"acRate\": \"35.8%\"}",
|
||||
"hints": [
|
||||
"Note that if the number is negative it's the same as positive but you look for the minimum instead.",
|
||||
"In the case of maximum, if s[i] < x it's optimal that x is put before s[i].",
|
||||
|
Reference in New Issue
Block a user