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
|
#!/usr/bin/perl
# Find which word (from a wordlist) has the most anagrams. Print out that
# word and all it's anagrams.
#
# Calculate the signature of every word in the dictionary, building %anag:
# signature -> list of words with that signature, keeping track of the
# longest list (i.e. the biggest anagram set so far) as we go.
use strict;
use warnings;
use Data::Dumper;
# "Usage: ch-2.pl [word list filename, default /u/s/d/words\n"
my $wordfile = shift // "/usr/share/dict/words";
#
# my $sig = makesig( $word );
# Build and return the SIGNATURE of the given word,
# as described at the top of this program. Easy to
# do in Perl, I love "join '' sort split //"
#
sub makesig
{
my( $word ) = @_;
return join( '', sort split(//,$word) );
}
# build %anag: signature -> list of words with that signature
# and keep track of the signature with the longest list of words
my %anag;
my $longestn = 0;
my $longestsig = "";
open(my $infh, '<', $wordfile) || die "can't open $wordfile\n";
while( <$infh> )
{
chomp;
my $sig = makesig( lc($_) );
my $aref = ($anag{$sig} //= []);
push @$aref, $_;
# keep track of longest(n,sig) as we go
my $len = @$aref;
if( $len > $longestn )
{
$longestn = $len;
$longestsig = $sig;
}
}
close( $infh );
die "AARGH..\n" if $longestn==0; # empty wordlist?
#die Dumper \%anag;
# ok, print answer - including the anagrams of the longest set
print "signature with most anagrams ($longestn): $longestsig\n";
my @anag = @{$anag{$longestsig}};
print "those anagrams are: ".join(',',@anag)."\n";
|
