aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJames Smith <js5@sanger.ac.uk>2021-11-16 14:45:14 +0000
committerGitHub <noreply@github.com>2021-11-16 14:45:14 +0000
commit4221056afa7ce74e354cab181df7d026c00fc037 (patch)
tree7e3e9358ebaa71bb5a6414bde5cfe6d998bc70cf
parent45c65f5a0c94cb0d4f8b4e4e423ba7a417ef871b (diff)
downloadperlweeklychallenge-club-4221056afa7ce74e354cab181df7d026c00fc037.tar.gz
perlweeklychallenge-club-4221056afa7ce74e354cab181df7d026c00fc037.tar.bz2
perlweeklychallenge-club-4221056afa7ce74e354cab181df7d026c00fc037.zip
Update README.md
-rw-r--r--challenge-139/james-smith/README.md3
1 files changed, 1 insertions, 2 deletions
diff --git a/challenge-139/james-smith/README.md b/challenge-139/james-smith/README.md
index 9daa5abd0d..997f3d064b 100644
--- a/challenge-139/james-smith/README.md
+++ b/challenge-139/james-smith/README.md
@@ -78,8 +78,7 @@ This gives us the function below to get the length of the recurring sequence.
sub rec_len {
my( $D, $N, $s ) = ( shift, 1, '' );
( $s, $N ) = ( $s.int($N/$D), ($N%$D).0 ) for 0 .. 2*$D;
- $s =~ m{(\d+?)\1+$};
- length $1;
+ $s =~ /(\d+?)\1+$/ ? length $1 : 0;
}
```