coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-19 20:16:48 +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

9
leetcode-cn/problem (Chinese)/二进制数转字符串 [bianry-number-to-string-lcci].html
View File

@@ -15,8 +15,11 @@
<strong> 提示</strong>：0.1无法被二进制准确表示
</pre>
<p>&nbsp;</p>
<p><strong>提示：</strong></p>
<ol>
<li>32位包括输出中的"0."这两位。</li>
</ol>
<ul>
<li>32位包括输出中的 <code>"0."</code> 这两位。</li>
<li>题目保证输入用例的小数位数最多只有 <code>6</code> 位</li>
</ul>

2
leetcode-cn/problem (Chinese)/找到指定长度的回文数 [find-palindrome-with-fixed-length].html
View File

@@ -11,7 +11,7 @@
<b>输出：</b>[101,111,121,131,141,999]
<strong>解释：</strong>
长度为 3 的最小回文数依次是：
101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 201, ...
101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, ...
第 90 个长度为 3 的回文数是 999 。
</pre>