coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-13 19:31: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

28
算法题（国内版）/problem (Chinese)/1～n 整数中 1 出现的次数 [1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof].html Normal file
View File

@@ -0,0 +1,28 @@
<p>输入一个整数 <code>n</code> ，求1～n这n个整数的十进制表示中1出现的次数。</p>
<p>例如，输入12，1～12这些整数中包含1 的数字有1、10、11和12，1一共出现了5次。</p>
<p> </p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入：</strong>n = 12
<strong>输出：</strong>5
</pre>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入：</strong>n = 13
<strong>输出：</strong>6</pre>
<p> </p>
<p><strong>限制：</strong></p>
<ul>
<li><code>1 <= n < 2^31</code></li>
</ul>
<p>注意：本题与主站 233 题相同：<a href="https://leetcode-cn.com/problems/number-of-digit-one/">https://leetcode-cn.com/problems/number-of-digit-one/</a></p>