find-the-closest-palindrome

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>n</code> representing an integer, return the closest integer (not including itself), which is a palindrome. If there is a tie, return the smaller one.

The closest is defined as the absolute difference minimized between two integers.

&nbsp;
Example 1:

<pre>
Input: n = &quot;123&quot;
Output: &quot;121&quot;
</pre>

Example 2:

<pre>
Input: n = &quot;1&quot;
Output: &quot;0&quot;
Explanation: 0 and 2 are the closest palindromes but we return the smallest which is 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n.length &lt;= 18</code></li>
	<li><code>n</code> consists of only digits.</li>
	<li><code>n</code> does not have leading zeros.</li>
	<li><code>n</code> is representing an integer in the range <code>[1, 1018 - 1]</code>.</li>
</ul>

nearestPalindromic

Find the Closest Palindrome

Find Palindrome With Fixed Length

find-palindrome-with-fixed-length

找到指定长度的回文数

Next Palindrome Using Same Digits

next-palindrome-using-same-digits

下个由相同数字构成的回文串

Find the Count of Good Integers

find-the-count-of-good-integers

统计好整数的数目

Find the Largest Palindrome Divisible by K

find-the-largest-palindrome-divisible-by-k

找出最大的 N 位 K 回文数

Math

String

给定一个表示整数的字符串&nbsp;<code>n</code> ，返回与它最近的回文整数（不包括自身）。如果不止一个，返回较小的那个。

“最近的”定义为两个整数差的绝对值最小。

&nbsp;

示例 1:

<pre>
输入: n = "123"
输出: "121"
</pre>

示例 2:

<pre>
输入: n = "1"
输出: "0"
解释: 0 和 2是最近的回文，但我们返回最小的，也就是 0。
</pre>

&nbsp;

提示:

<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, 1018&nbsp;- 1]</code> 范围内的整数</li>
</ul>