coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/[no content]digit-count-in-range.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": true,
"difficulty": "Hard",
"likes": 60,
"likes": 61,
"dislikes": 14,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Number of Digit One\", \"titleSlug\": \"number-of-digit-one\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"6.2K\", \"totalAcceptedRaw\": 2634, \"totalSubmissionRaw\": 6181, \"acRate\": \"42.6%\"}",
"stats": "{\"totalAccepted\": \"2.6K\", \"totalSubmission\": \"6.2K\", \"totalAcceptedRaw\": 2637, \"totalSubmissionRaw\": 6184, \"acRate\": \"42.6%\"}",
"hints": [
"Define a function f(x) to get the requested sum from 1 to x. So the answer will be f(hi) - f(lo - 1)",
"In order to solve f(x) we need to do a DP over digits approach."