diff options
| author | James Smith <js5@sanger.ac.uk> | 2022-11-29 08:15:38 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-11-29 08:15:38 +0000 |
| commit | c1f05931f4a6438627eb4794ed852ec66af243c2 (patch) | |
| tree | b5fd69743f0fdc67c964c313531b86c164505f0e | |
| parent | c4876f9ff9a89cf2b2f4b0b9340bb313c7c3f28f (diff) | |
| download | perlweeklychallenge-club-c1f05931f4a6438627eb4794ed852ec66af243c2.tar.gz perlweeklychallenge-club-c1f05931f4a6438627eb4794ed852ec66af243c2.tar.bz2 perlweeklychallenge-club-c1f05931f4a6438627eb4794ed852ec66af243c2.zip | |
Update ch-2.pl
| -rw-r--r-- | challenge-193/james-smith/perl/ch-2.pl | 75 |
1 files changed, 54 insertions, 21 deletions
diff --git a/challenge-193/james-smith/perl/ch-2.pl b/challenge-193/james-smith/perl/ch-2.pl index 2c004a7e6c..35391469fa 100644 --- a/challenge-193/james-smith/perl/ch-2.pl +++ b/challenge-193/james-smith/perl/ch-2.pl @@ -5,19 +5,30 @@ use warnings; use feature qw(say); use Test::More; -my @list1 = ( 'bob', map { chr(97+rand(26)) x 3 } 1..10000 ); -my @list2 = ( ( map { chr(97+rand(26)) x 3 } 1..10000 ), 'bob' ); +my $SIZE = 100; + +my %map2 = map { my $a=$_; map { ("$a$_" => ord($a)-ord($_)) } 'a'..'z' } 'a'..'z'; +my %map3 = map { my $b = $_; map { my $a=$_; map { ("$a$b$_" => ord($a)*99-ord($b)*100+ord($_)) } 'a'..'z' } 'a'..'z' } 'a'..'z'; +my @list = map { chr(97+rand(26)) x 3 } 1..$SIZE; my @TESTS = ( - [ [qw(adc wzy abc)], 'abc' ], + [ [qw(adc wzy abc)], 'abc' ], + [ [qw(bob bbb ccc ddd)], 'bob' ], [ [qw(aaa bob ccc ddd)], 'bob' ], - [ [@list1], 'bob' ], - [ [@list2], 'bob' ], + [ [qw(aaa bbb bob ddd)], 'bob' ], + [ [qw(aaa bbb ccc bob)], 'bob' ], + ## Put "bob" in every position within the list... + map { my $t = [ @list ]; $t->[$_]='bob'; [ $t, 'bob' ] } 0..$SIZE-1 +); +my @TESTS = + @lists, ); -is( odd_string_array( @{$_->[0]} ), $_->[1] ) for @TESTS; -is( odd_string_fast( @{$_->[0]} ), $_->[1] ) for @TESTS; +is( odd_string_array( @{$_->[0]} ), $_->[1] ) for @TESTS; +is( odd_string_ord( @{$_->[0]} ), $_->[1] ) for @TESTS; +is( odd_string_map_2( @{$_->[0]} ), $_->[1] ) for @TESTS; +is( odd_string_map_3( @{$_->[0]} ), $_->[1] ) for @TESTS; -sub odd_string_array { +sub odd_string { my %x; ## Keyed by signature - so one key will have push @{$x{ @@ -28,20 +39,42 @@ sub odd_string_array { [ grep { @{$_}==1 } values %x ]->[0][0] } -sub odd_string_fast { - my($x1,$x2,$y1,$y2,$z1,$z2) = ( - ord($_[0]) - ord(substr$_[0],1), ord($_[0]) - ord(substr$_[0],2), - ord($_[1]) - ord(substr$_[1],1), ord($_[1]) - ord(substr$_[1],2), - ord($_[2]) - ord(substr$_[2],1), ord($_[2]) - ord(substr$_[2],2), +sub odd_string_ord { + my($x1,$x2) = ( + ord($_[0]) - ord(substr$_[0],1), ord($_[0]) - ord(substr$_[0],2), ); - if( $x1 == $y1 && $x2 == $y2 ) { ## First & second match so NOT 1st - if( $x1 == $z1 && $x2 == $z2 ) { ## Third matches first - so find first which doesn't - ( $x1 != ord($_) - ord(substr$_,1) || $x2 != ord($_) - ord(substr$_,2) ) && return $_ for @_[3..$#_]; - } else { - return $_[2]; - } - } ## Different so it must be 1st or ceons - $_[ $x1 == $z1 && $x2 == $z2 ? 1 : 0 ] + ## The first two characters are different - so we need to check the first against the third + ## If it is the same then the character we want is the second character o/w the first + ## Note the comparison returns 1 if true & 0 if false so can use that as the index to @_ + return $_[ $x1 == ord($_[2]) - ord(substr$_[2],1) && $x2 == ord($_[2]) - ord(substr$_[2],2) ] + if $x1 != ord($_[1]) - ord(substr$_[1],1) || $x2 != ord($_[1]) - ord(substr$_[1],2); + ## We remove the first two strings as we don't need to compare them... + splice@_,0,2; + ## Compare all strings {we will end up with an answer as we know there is a unique string + ( $x1 != ord($_ ) - ord(substr$_,1) || $x2 != ord($_) - ord(substr$_,2 ) ) && return $_ for @_; + ## in the list... +} + +## Pre compute `ord($a) - ord($b)` for two letters [keyed with the string `"$a$b"`] and use +## this to avoid the repeated ord calculation.... (676 entries) +## This isn't as efficient as the ord calculation tho! +sub odd_string_map_2 { + my($x1,$x2) = ( $map2{ substr $_[0],0,2 }, $map2{ substr $_[0],1,2 } ); + return $_[ $x1 == $map2{ substr $_[2],0,2 } && $x2 == $map2{ substr $_[2],1,2 } ] + if $x1 != $map2{ substr $_[1],0,2 } || $x2 != $map2{ substr $_[1],1,2 }; + splice@_,0,2; + ( $x1 != $map2{ substr $_, 0,2 } || $x2 != $map2{ substr $_, 1,2 } ) && return $_ for @_; } +## Pre compute the signature for all triples (17,576 entries) +## this to avoid the repeated ord calculation...., and now the `substr` operation +## as well - this gives us the simpler code.... + +sub odd_string_map_3 { + my $x = $map3{ $_[0] }; + return $_[ $x == $map3{ $_[2] } ] + if $x != $map3{ $_[1] }; + splice@_,0,2; + $x == $map3{ $_ } || return $_ for @_; +} |
