coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +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-cn/originData/number-of-2s-in-range-lcci.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"21.9K\", \"totalAcceptedRaw\": 10961, \"totalSubmissionRaw\": 21891, \"acRate\": \"50.1%\"}",
"stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"21.9K\", \"totalAcceptedRaw\": 10963, \"totalSubmissionRaw\": 21893, \"acRate\": \"50.1%\"}",
"hints": [
"从蛮力解法开始。",
"不要计算每一个数中有多少个2，要一位数一位数地想，也就是说，首先计算(对于每个数字)第 1 位中有多少个 2，然后计算(对于每个数字)第 2 位中有多少个 2，再计算(对于每个数字)第 3 位中有多少个 2，以此类推。",