coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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-ways-to-separate-numbers.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 5526, \"totalSubmissionRaw\": 27185, \"acRate\": \"20.3%\"}",
"stats": "{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"27.2K\", \"totalAcceptedRaw\": 5529, \"totalSubmissionRaw\": 27192, \"acRate\": \"20.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."