coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-09 01:11:42 +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-2s-in-range-lcci.json
View File

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