-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdiscrete.java
More file actions
69 lines (64 loc) · 1.69 KB
/
discrete.java
File metadata and controls
69 lines (64 loc) · 1.69 KB
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
import java.util.Random;
import java.util.Scanner;
import java.util.ArrayList;
import java.util.List;
public class discrete {
public static void main(String[] args) {
String input = "ABCDEF";
List<String> permutations = generatePermutations(input);
for (String perm : permutations) {
System.out.println(perm);
}
}
public static List<String> generatePermutations(String input) {
List<String> permutations = new ArrayList<>();
boolean[] used = new boolean[input.length()];
StringBuilder current = new StringBuilder();
generatePermutationsHelper(input, current, used, permutations);
return permutations;
}
private static void generatePermutationsHelper(String input, StringBuilder current, boolean[] used,
List<String> permutations) {
if (current.length() == input.length()) {
permutations.add(current.toString());
return;
}
for (int i = 0; i < input.length(); i++) {
if (!used[i]) {
current.append(input.charAt(i));
used[i] = true;
generatePermutationsHelper(input, current, used, permutations);
current.deleteCharAt(current.length() - 1);
used[i] = false;
while (i + 1 < input.length() && input.charAt(i) == input.charAt(i + 1)) {
i++;
}
}
}
}
}
/*
* public static void main(String[] args) {
* String[] letters = { "A", "B", "C", "D", "E", "F" };
* String[] permutations = new String[6];
*
*
*
*
*
* for(int i = 0; i<letters.length; i++) {
* int counter = 0;
* int ext = 0;
* char c = letters[i].charAt(i);
* for(int j =0;j<i;j++){
* if(c==letters[j].charAt(j)){
* counter++;
* }
* }
* if(counter==1){
* ext += 1;
* }
* }
*
* }
*/