Lexicographically n-th permutation of a string
Given a string of length m containing lowercase alphabets only. You have to find the n-th permutation of string lexicographically.
Examples:
Input : str[] = "abc", n = 3 Output : Result = "bac" Explanation : All possible permutation in sorted order: abc, acb, bac, bca, cab, cba Input : str[] = "aba", n = 2 Output : Result = "aba" Explanation : All possible permutation in sorted order: aab, aba, baa
Prerequisite : Permutations of a given string using STL
Idea behind printing n-th permutation is quite simple we should use STL (explained in above link) for finding next permutation and do it till the nth permutation. After n-th iteration, we should break from the loop and then print the string which is our nth permutation.
long int i = 1;
do
{
// check for nth iteration
if (i == n)
break;
i++; // keep incrementing the iteration
} while (next_permutation(str.begin(), str.end()));
// print string after nth iteration
print str;
C++
// C++ program to print nth permutation with // using next_permute() #include <bits/stdc++.h> using namespace std; // Function to print nth permutation // using next_permute() void nPermute(string str, long int n) { // Sort the string in lexicographically // ascending order sort(str.begin(), str.end()); // Keep iterating until // we reach nth position long int i = 1; do { // check for nth iteration if (i == n) break; i++; } while (next_permutation(str.begin(), str.end())); // print string after nth iteration cout << str; } // Driver code int main() { string str = "GEEKSFORGEEKS"; long int n = 100; nPermute(str, n); return 0; } |
chevron_right
filter_none
Java
// Java program to print nth permutation with // using next_permute() import java.util.*; class GFG { // Function to print nth permutation // using next_permute() static void nPermute(char[] str, int n) { // Sort the string in lexicographically // ascending order Arrays.sort(str); // Keep iterating until // we reach nth position int i = 1; do { // check for nth iteration if (i == n) break; i++; } while (next_permutation(str)); // print string after nth iteration System.out.println(String.valueOf(str)); } static boolean next_permutation(char[] p) { for (int a = p.length - 2; a >= 0; --a) if (p[a] < p[a + 1]) for (int b = p.length - 1;; --b) if (p[b] > p[a]) { char t = p[a]; p[a] = p[b]; p[b] = t; for (++a, b = p.length - 1; a < b; ++a, --b) { t = p[a]; p[a] = p[b]; p[b] = t; } return true; } return false; } // Driver code public static void main(String[] args) { String str = "GEEKSFORGEEKS"; int n = 100; nPermute(str.toCharArray(), n); } } // This code contributed by Rajput-Ji |
chevron_right
filter_none
C#
// C# program to print nth permutation with // using next_permute() using System; class GFG { // Function to print nth permutation // using next_permute() static void nPermute(char[] str, int n) { // Sort the string in lexicographically // ascending order Array.Sort(str); // Keep iterating until // we reach nth position int i = 1; do { // check for nth iteration if (i == n) break; i++; } while (next_permutation(str)); // print string after nth iteration Console.WriteLine(String.Join("",str)); } static bool next_permutation(char[] p) { for (int a = p.Length - 2; a >= 0; --a) if (p[a] < p[a + 1]) for (int b = p.Length - 1;; --b) if (p[b] > p[a]) { char t = p[a]; p[a] = p[b]; p[b] = t; for (++a, b = p.Length - 1; a < b; ++a, --b) { t = p[a]; p[a] = p[b]; p[b] = t; } return true; } return false; } // Driver code public static void Main() { String str = "GEEKSFORGEEKS"; int n = 100; nPermute(str.ToCharArray(), n); } } /* This code contributed by PrinciRaj1992 */ |
chevron_right
filter_none
Output:
EEEEFGGRKSOSK
Find n-th lexicographically permutation of a string | Set 2
This article is contributed by Shivam Pradhan (anuj_charm). If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Recommended Posts:
- Find n-th lexicographically permutation of a string | Set 2
- Lexicographically smallest permutation of a string with given subsequences
- Lexicographically next permutation in C++
- How to find Lexicographically previous permutation?
- Lexicographically Smallest Permutation of length N such that for exactly K indices, a[i] > a[i] + 1
- Lexicographically smallest permutation of {1, .. n} such that no. and position do not match
- Lexicographically smallest permutation with no digits at Original Index
- Lexicographically smallest permutation with distinct elements using minimum replacements
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- Lexicographically smallest string whose hamming distance from given string is exactly K
- Lexicographically next string
- Lexicographically first palindromic string
- Lexicographically middle string
- Minimum length of string having all permutation of given string.
- Length of the longest substring that do not contain any palindrome
- Minimum cost to convert str1 to str2 with the given operations
- Check if expression contains redundant bracket or not | Set 2
- Longest substring such that no three consecutive characters are same
- Convert a String to an Integer using Recursion
