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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/number-of-beautiful-integers-in-the-range.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7K\", \"totalSubmission\": \"41.5K\", \"totalAcceptedRaw\": 7042, \"totalSubmissionRaw\": 41465, \"acRate\": \"17.0%\"}",
"stats": "{\"totalAccepted\": \"7K\", \"totalSubmission\": \"41.5K\", \"totalAcceptedRaw\": 7044, \"totalSubmissionRaw\": 41494, \"acRate\": \"17.0%\"}",
"hints": [
"<div class=\"_1l1MA\">The intended solution uses Dynamic Programming.</div>",
"<div class=\"_1l1MA\">Let <code> f(n) </code> denote number of beautiful integers in the range <code> [1…n] </code>, then the answer is <code> f(r) - f(l-1) </code>.</div>"