-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day_63_Permutations.java
36 lines (32 loc) · 995 Bytes
/
Day_63_Permutations.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
package com.TrX;
import java.util.*;
public class Day_63_Permutations {
public static String swap(String a, int i, int j) {
char temp;
char[] charArray = a.toCharArray();
temp = charArray[i];
charArray[i] = charArray[j];
charArray[j] = temp;
return String.valueOf(charArray);
}
static void permute(String str, int l, int r) {
if (l == r)
System.out.println(str);
else {
for (int i = l; i <= r; i++) {
str = swap(str, l, i);
permute(str, l + 1, r);
str = swap(str, l, i);
}
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter word for all possible combinations-");
String str = sc.next();
int n = str.length();
System.out.println("All possible combinations-");
permute(str, 0, n - 1);
sc.close();
}
}