What is an elegant way to find all the permutations of a string. E.g. permutation for ba, would be ba and ab, but what about longer string such as abcdefgh? Is there any Java implementation example?
To find all possible permutations of a given string, you can use the itertools module which has a useful method called permutations(iterable[, r]). This method return successive r length permutations of elements in the iterable as tuples.
public static void permutation(String str) {      permutation("", str);  }  private static void permutation(String prefix, String str) {     int n = str.length();     if (n == 0) System.out.println(prefix);     else {         for (int i = 0; i < n; i++)             permutation(prefix + str.charAt(i), str.substring(0, i) + str.substring(i+1, n));     } }   (via Introduction to Programming in Java)
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With