Todos los desafíos
Intermedio 0 resueltos 0% de aceptación

Lexicographic Permutation

Find the k-th arrangement of some distinct characters in dictionary order.

Lo que aprenderás

  • Skip whole blocks of permutations at once
  • Convert a rank to a permutation
  • Work with 0-based and 1-based positions

Problema

Ver traducción

List every arrangement of the characters of s in dictionary order. For "abc" the list is abc, acb, bac, bca, cab, cba. Return the k-th entry, counting from 1. Generating the whole list is too slow for 12 characters (479,001,600 arrangements): each block of arrangements that starts with the same character has (length − 1)! entries, so you can pick one character at a time.

Implement lexicographic_permutation(s, k).

Input

s: Distinct characters in any order.

k: The position in the sorted list, counting from 1.

Output

Return the k-th arrangement as a string. Characters are compared by their character codes, so digits come before uppercase letters, which come before lowercase letters.

Restricciones

1 ≤ s.length ≤ 12; all characters of s are distinct; 1 ≤ k ≤ s.length!

Ejemplos

Ejemplo 1
Entrada:
s = "abc"
k = 4

Salida esperada:
expected = "bca"
Entrada:
std::string s = "abc";
long long k = 4;

Salida esperada:
std::string expected = "bca";
Entrada:
string s = "abc";
long k = 4;

Salida esperada:
string expected = "bca";

Explicación

The list is abc, acb, bac, bca, cab, cba, and the fourth is "bca".

Ejemplo 2
Entrada:
s = "312"
k = 1

Salida esperada:
expected = "123"
Entrada:
std::string s = "312";
long long k = 1;

Salida esperada:
std::string expected = "123";
Entrada:
string s = "312";
long k = 1;

Salida esperada:
string expected = "123";

Explicación

The first arrangement is the characters in sorted order: "123".

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

Sort the characters first.

Pista 2

Each choice of first character covers (length − 1)! permutations, so dividing k − 1 by that number picks it.

Pista 3

Remove the chosen character, keep the remainder, and repeat with the rest.

Complejidad esperada

O(n²) time, O(n) extra space

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

Clasificación

Clasificación completa

La mejor solución aprobada de cada programador. Las más rápidas, ligeras y mejor valoradas van primero.

Aún no hay soluciones aprobadas. Resuélvelo y quédate el primer puesto.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.