coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-12 17:05:15 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
leetcode-cn/problem (Chinese)/2出现的次数 [number-of-2s-in-range-lcci].html
View File

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