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

add leetcode problem-cn part2

Browse Source
This commit is contained in:
小墨
2022-03-27 20:38:29 +08:00
parent 5a4fa6db12
commit 0fc7f4b734
1617 changed files with 134637 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
算法题（国内版）/problem (Chinese)/2出现的次数 [number-of-2s-in-range-lcci].html Normal file
View File

@@ -0,0 +1,13 @@
<p>编写一个方法，计算从 0 到 n (含 n) 中数字 2 出现的次数。</p>
<p><strong>示例:</strong></p>
<pre><strong>输入: </strong>25
<strong>输出: </strong>9
<strong>解释: </strong>(2, 12, 20, 21, 22, 23, 24, 25)(注意 22 应该算作两次)</pre>
<p>提示：</p>
<ul>
<li><code>n &lt;= 10^9</code></li>
</ul>