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,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 215,
|
||||
"dislikes": 28,
|
||||
"likes": 227,
|
||||
"dislikes": 29,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Decode Ways\", \"titleSlug\": \"decode-ways\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Decode Ways II\", \"titleSlug\": \"decode-ways-ii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Restore The Array\", \"titleSlug\": \"restore-the-array\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "\"327\"\n\"094\"\n\"0\"",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"11.8K\", \"totalAcceptedRaw\": 2649, \"totalSubmissionRaw\": 11835, \"acRate\": \"22.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"12.4K\", \"totalAcceptedRaw\": 2759, \"totalSubmissionRaw\": 12370, \"acRate\": \"22.3%\"}",
|
||||
"hints": [
|
||||
"If we know the current number has d digits, how many digits can the previous number have?",
|
||||
"Is there a quick way of calculating the number of possibilities for the previous number if we know that it must have less than or equal to d digits? Try to do some pre-processing."
|
||||
|
Reference in New Issue
Block a user