mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"18K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 17971, \"totalSubmissionRaw\": 37879, \"acRate\": \"47.4%\"}",
|
||||
"stats": "{\"totalAccepted\": \"18K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 17972, \"totalSubmissionRaw\": 37881, \"acRate\": \"47.4%\"}",
|
||||
"hints": [
|
||||
"For a substring consisting of the same digit, how can we count the number of texts it could have originally represented?",
|
||||
"How can dynamic programming help us calculate the required answer?"
|
||||
|
Reference in New Issue
Block a user