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

add leetcode problem-cn part3

Browse Source
This commit is contained in:
小墨
2022-03-27 20:46:41 +08:00
parent 6dafca13c5
commit dfacb20d31
1385 changed files with 115239 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
算法题（国内版）/problem (Chinese)/寻找最近的回文数 [find-the-closest-palindrome].html Normal file
View File

@@ -0,0 +1,31 @@
<p>给定一个表示整数的字符串&nbsp;<code>n</code> ，返回与它最近的回文整数（不包括自身）。如果不止一个，返回较小的那个。</p>
<p>“最近的”定义为两个整数<strong>差的绝对值</strong>最小。</p>
<p>&nbsp;</p>
<p><strong>示例 1:</strong></p>
<pre>
<strong>输入:</strong> n = "123"
<strong>输出:</strong> "121"
</pre>
<p><strong>示例 2:</strong></p>
<pre>
<strong>输入:</strong> n = "1"
<strong>输出:</strong> "0"
<strong>解释:</strong> 0 和 2是最近的回文，但我们返回最小的，也就是 0。
</pre>
<p>&nbsp;</p>
<p><strong>提示:</strong></p>
<ul>
<li><code>1 &lt;= n.length &lt;= 18</code></li>
<li><code>n</code>&nbsp;只由数字组成</li>
<li><code>n</code>&nbsp;不含前导 0</li>
<li><code>n</code>&nbsp;代表在&nbsp;<code>[1, 10<sup>18</sup>&nbsp;- 1]</code> 范围内的整数</li>
</ul>