-
Notifications
You must be signed in to change notification settings - Fork 0
/
hexspeak.java
67 lines (62 loc) · 2.18 KB
/
hexspeak.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
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
import java.io.BufferedReader;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
public class hexspeak {
public static Integer counter = 0;
public static List<String> getGoodWords() {
List<String> goodWords = new ArrayList<String>();
try {
Pattern p = Pattern.compile("^[abcdef]*$");
BufferedReader br = new BufferedReader(new FileReader("words"));
String line;
while ((line = br.readLine()) != null) {
if (line.length() > 2 && p.matcher(line).matches()) {
goodWords.add(line);
}
}
goodWords.add("a");
}
catch(Exception e) {}
return goodWords;
}
public static void main(String[] args) {
List<String> goodWords = getGoodWords();
Map<Integer, List<String>> wordsByLength =
goodWords.stream().collect(Collectors.groupingBy(w -> w.length()));
for(int i=0; i<10; i++) {
counter = 0;
long startTime = System.nanoTime();
solve(wordsByLength, 14, 0, new HashSet<String>());
long endTime = System.nanoTime();
System.out.printf("%d in %d ms.\n", counter, (endTime-startTime)/1000000);
}
}
public static void solve(
Map<Integer, List<String>> wordsByLength,
int targetLength,
int phraseLength,
HashSet<String> usedWords)
{
for(int i=1; i<targetLength-phraseLength+1; i++) {
List<String> candidates = wordsByLength.get(i);
if (candidates == null) continue;
for(String w: candidates) {
if(!usedWords.contains(w)) {
if (phraseLength+i == targetLength) {
counter++;
} else {
usedWords.add(w);
solve(wordsByLength, targetLength, phraseLength+i, usedWords);
usedWords.remove(w);
}
}
}
}
}
}