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:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/number-of-ways-to-separate-numbers.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"988\", \"totalSubmission\": \"3.7K\", \"totalAcceptedRaw\": 988, \"totalSubmissionRaw\": 3690, \"acRate\": \"26.8%\"}",
"stats": "{\"totalAccepted\": \"989\", \"totalSubmission\": \"3.7K\", \"totalAcceptedRaw\": 989, \"totalSubmissionRaw\": 3704, \"acRate\": \"26.7%\"}",
"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."