aboutsummaryrefslogtreecommitdiff
path: root/challenge-161
diff options
context:
space:
mode:
authorJulien Fiegehenn <simbabque@cpan.org>2022-04-23 23:04:47 +0100
committerJulien Fiegehenn <simbabque@cpan.org>2022-04-23 23:04:47 +0100
commit0f3d9a6af4858fb586771cd1d7cd66cc6bc68407 (patch)
tree3a2c3845f69a3fdeeaaf9a6665b6353ab64c4273 /challenge-161
parentfe2e710182ad6c91e55ecee6f37bbf7c6a72eb3d (diff)
downloadperlweeklychallenge-club-0f3d9a6af4858fb586771cd1d7cd66cc6bc68407.tar.gz
perlweeklychallenge-club-0f3d9a6af4858fb586771cd1d7cd66cc6bc68407.tar.bz2
perlweeklychallenge-club-0f3d9a6af4858fb586771cd1d7cd66cc6bc68407.zip
I forgot the sorting!
Diffstat (limited to 'challenge-161')
-rw-r--r--challenge-161/julien-fiegehenn/perl/ch-1.pl7
1 files changed, 6 insertions, 1 deletions
diff --git a/challenge-161/julien-fiegehenn/perl/ch-1.pl b/challenge-161/julien-fiegehenn/perl/ch-1.pl
index ce487004a6..d6201f6e06 100644
--- a/challenge-161/julien-fiegehenn/perl/ch-1.pl
+++ b/challenge-161/julien-fiegehenn/perl/ch-1.pl
@@ -8,12 +8,17 @@ my @dictionary
= do { open my $fh, '<', 'data/dictionary.txt' or die $!; <$fh>; };
chomp @dictionary;
+my %words;
WORD: for my $word (@dictionary) {
+ next if length $word < 2;
# say $word if join(q{}, sort split //, $word) eq $word; ## this seems like the obvious solution
my @letters = split //, $word;
for my $i (0 .. $#letters - 1) {
next WORD unless ord($letters[$i]) <= ord($letters[$i + 1]);
}
- say $word;
+ $words{$word} = length $word;
}
+
+# hi, below empty deers cry most knotty eggs no apt gin.
+say for sort { $words{$b} <=> $words{$a} } keys %words; \ No newline at end of file