-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathword-twist-solver.pl
133 lines (123 loc) · 3.2 KB
/
word-twist-solver.pl
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
use Modern::Perl;
use Data::Printer;
use autodie qw(:all);
my $trie = {};
my %seen;
sub insert {
my ($root, $word) = @_;
sub insert_rec {
my $current = shift;
return $current unless @_;
my $letter = shift;
my $next = $current->{$letter} //= {};
return insert_rec($next, @_);
}
if ($word =~ /\*$/) {
$word = substr($word, 0, -1);
$seen{$word} = 1;
}
my $end = insert_rec($root, sort split //, $word);
push(@{$end->{words}}, $word);
}
sub remove {
my ($root, $word) = @_;
my @stack;
sub remove_rec {
my ($current, $word, $letter, @rest) = @_;
if ($letter) {
my $next = $current->{$letter};
if (remove_rec($next, $word, @rest)) {
delete $current->{$letter};
}
}
else {
my @words = grep { $_ ne $word } @{$current->{words}};
if (@words) {
$current->{words} = [@words];
} else {
delete $current->{words};
}
}
return keys %$current == 0;
}
remove_rec($root, $word, sort split //, $word);
}
say "Creating Trie";
{
open(my $words, '<', $ARGV[0]);
while(my $word = <$words>) {
chomp($word);
insert($trie, $word);
}
close $words;
}
say "Done creating Trie";
sub search
{
my @result;
my $current = shift;
return unless @_;
my $letter = shift;
if (exists $current->{$letter}) {
my $next = $current->{$letter};
push(@result, @{$next->{words}}) if exists $next->{words};
push(@result, search($next, @_));
}
# Skip duplicated letters when we are skipping this occurance of the letter to remove duplicated words.
shift while @_ && $_[0] eq $letter;
push(@result, search($current, @_));
return @result;
}
sub all
{
my ($current, $action) = @_;
my @words = @{$current->{words} // []};
$action->($_) foreach @words;
while(my ($letter, $next) = each %$current) {
all($next, $action) if $letter ne 'words';
}
}
my $modified;
while (1) {
print "Letters: ";
my $letters = <STDIN> // '';
chomp($letters);
last unless $letters;
my @letters = split //, $letters;
next unless @letters == 6;
my @result = search($trie, sort @letters);
@result = sort { length $b <=> length $a or $a cmp $b } @result;
say foreach (@result);
foreach (@result) {
next if $seen{$_};
print "$_: ";
chomp(my $resp = <STDIN> // '');
if ($resp && 'remove' =~ /$resp/) {
$modified = 1;
remove($trie, $_);
} else {
$seen{$_} = 1;
}
}
while (1) {
print "Add: ";
chomp(my $resp = <STDIN> // '');
last unless $resp;
insert($trie, $resp);
$seen{$resp} = 1;
$modified = 1;
}
}
{
open(my $words, '>', $ARGV[0]);
my @words;
all($trie, sub {
my $word = shift;
$word .= '*' if $seen{$word};
push(@words, $word);
});
@words = sort @words;
my $last = '';
@words = grep {my $result = $_ ne $last; $last = $_; $result; } @words;
print $words "$_\n" foreach @words;
}