In this section, you will learn how to display all possible permutations of a given input string. A permutation refers to the rearranging of a number of objects or values. Informally, a permutation of a set of values is an arrangement of those values into a particular order. Here we are going to work with permutations of strings.
Description & code of Java String Permutation:
In the following code, we have allowed the user to input string of their choice. A for loop then iterates through each character of the string and create new string to permute by eliminating the character at index i. Then, we have used recursion method with a new string to compute all possible sets of the string.
Here is the code:
import java.util.*;
public class PermutationExample {
public static void main(String args[]) throws Exception {
Scanner input = new Scanner(System.in);
System.out.print("Enter String: ");
String chars = input.next();
showPattern("", chars);
}
public static void showPattern(String st, String chars) {
if (chars.length() <= 1)
System.out.println(st + chars);
else
for (int i = 0; i < chars.length(); i++) {
try {
String newString = chars.substring(0, i)
+ chars.substring(i + 1);
showPattern(st + chars.charAt(i), newString);
} catch (Exception e) {
e.printStackTrace();
}
}
}
}
Output:
| Enter String: abc abc acb bac bca cab cba |
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.