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

add leetcode problem-cn part1

Browse Source
This commit is contained in:
小墨
2022-03-27 20:37:52 +08:00
parent 8e542045d1
commit c554fc6908
1285 changed files with 108123 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
算法题（国内版）/problem (Chinese)/千位分隔数 [thousand-separator].html Normal file
View File

@@ -0,0 +1,35 @@
<p>给你一个整数&nbsp;<code>n</code>，请你每隔三位添加点（即 &quot;.&quot; 符号）作为千位分隔符，并将结果以字符串格式返回。</p>
<p>&nbsp;</p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>n = 987
<strong>输出：</strong>&quot;987&quot;
</pre>
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>n = 1234
<strong>输出：</strong>&quot;1.234&quot;
</pre>
<p><strong>示例 3：</strong></p>
<pre><strong>输入：</strong>n = 123456789
<strong>输出：</strong>&quot;123.456.789&quot;
</pre>
<p><strong>示例 4：</strong></p>
<pre><strong>输入：</strong>n = 0
<strong>输出：</strong>&quot;0&quot;
</pre>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ul>
<li><code>0 &lt;= n &lt; 2^31</code></li>
</ul>