k-th-smallest-in-lexicographical-order

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 two integers <code>n</code> and <code>k</code>, return the <code>kth</code> lexicographically smallest integer in the range <code>[1, n]</code>.

&nbsp;
Example 1:

<pre>
Input: n = 13, k = 2
Output: 10
Explanation: The lexicographical order is [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9], so the second smallest number is 10.
</pre>

Example 2:

<pre>
Input: n = 1, k = 1
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= k &lt;= n &lt;= 109</code></li>
</ul>

findKthNumber

K-th Smallest in Lexicographical Order

Count Special Integers

count-special-integers

统计特殊整数

Trie

给定整数&nbsp;<code>n</code>&nbsp;和&nbsp;<code>k</code>，返回&nbsp;&nbsp;<code>[1, n]</code>&nbsp;中字典序第&nbsp;<code>k</code>&nbsp;小的数字。

&nbsp;

示例 1:

<pre>
输入: n = 13, k = 2
输出: 10
解释: 字典序的排列是 [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]，所以第二小的数字是 10。
</pre>

示例 2:

<pre>
输入: n = 1, k = 1
输出: 1
</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= k &lt;= n &lt;= 109</code></li>
</ul>