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": "Easy",
|
||||
"likes": 918,
|
||||
"likes": 922,
|
||||
"dislikes": 41,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Largest Odd Number in String\", \"titleSlug\": \"largest-odd-number-in-string\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"127.1K\", \"totalSubmission\": \"183K\", \"totalAcceptedRaw\": 127111, \"totalSubmissionRaw\": 182990, \"acRate\": \"69.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"127.7K\", \"totalSubmission\": \"183.9K\", \"totalAcceptedRaw\": 127697, \"totalSubmissionRaw\": 183859, \"acRate\": \"69.5%\"}",
|
||||
"hints": [
|
||||
"We can sequentially check if “999”, “888”, “777”, … , “000” exists in num in that order. The first to be found is the maximum good integer.",
|
||||
"If we cannot find any of the above integers, we return an empty string “”."
|
||||
|
Reference in New Issue
Block a user