find-palindrome-with-fixed-length

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 an integer array <code>queries</code> and a positive integer <code>intLength</code>, return an array <code>answer</code> where <code>answer[i]</code> is either the <code>queries[i]th</code> smallest positive palindrome of length <code>intLength</code> or <code>-1</code> if no such palindrome exists.

A palindrome is a number that reads the same backwards and forwards. Palindromes cannot have leading zeros.

&nbsp;
Example 1:

<pre>
Input: queries = [1,2,3,4,5,90], intLength = 3
Output: [101,111,121,131,141,999]
Explanation:
The first few palindromes of length 3 are:
101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, ...
The 90th palindrome of length 3 is 999.
</pre>

Example 2:

<pre>
Input: queries = [2,4,6], intLength = 4
Output: [1111,1331,1551]
Explanation:
The first six palindromes of length 4 are:
1001, 1111, 1221, 1331, 1441, and 1551.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= queries.length &lt;= 5 * 104</code></li>
	<li><code>1 &lt;= queries[i] &lt;= 109</code></li>
	<li><code>1 &lt;= intLength&nbsp;&lt;= 15</code></li>
</ul>

kthPalindrome

Find Palindrome With Fixed Length

Palindrome Number

palindrome-number

回文数

Find the Closest Palindrome

find-the-closest-palindrome

寻找最近的回文数

Lexicographically Smallest Beautiful String

lexicographically-smallest-beautiful-string

字典序最小的美丽字符串

Array

Math

给你一个整数数组&nbsp;<code>queries</code>&nbsp;和一个 正&nbsp;整数&nbsp;<code>intLength</code>&nbsp;，请你返回一个数组&nbsp;<code>answer</code>&nbsp;，其中&nbsp;<code>answer[i]</code> 是长度为&nbsp;<code>intLength</code>&nbsp;的&nbsp;正回文数 中第&nbsp;<code>queries[i]</code>&nbsp;小的数字，如果不存在这样的回文数，则为 <code>-1</code>&nbsp;。

回文数 指的是从前往后和从后往前读一模一样的数字。回文数不能有前导 0 。

&nbsp;

示例 1：

<pre>
输入：queries = [1,2,3,4,5,90], intLength = 3
输出：[101,111,121,131,141,999]
解释：
长度为 3 的最小回文数依次是：
101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, ...
第 90 个长度为 3 的回文数是 999 。
</pre>

示例 2：

<pre>
输入：queries = [2,4,6], intLength = 4
输出：[1111,1331,1551]
解释：
长度为 4 的前 6 个回文数是：
1001, 1111, 1221, 1331, 1441 和 1551 。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= queries.length &lt;= 5 * 104</code></li>
	<li><code>1 &lt;= queries[i] &lt;= 109</code></li>
	<li><code>1 &lt;= intLength&nbsp;&lt;= 15</code></li>
</ul>