diff options
| -rw-r--r-- | challenge-151/james-smith/README.md | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/challenge-151/james-smith/README.md b/challenge-151/james-smith/README.md index 80a5abf3e7..ccbe61c38d 100644 --- a/challenge-151/james-smith/README.md +++ b/challenge-151/james-smith/README.md @@ -24,8 +24,9 @@ The method is to: * Split the string into the individual rows. * For each row check to see if the row is complete {has enough entries so that there are no parent nodes with no data} * If there are less than `2**$d-1` entries then this row is "incomplete" and we return the depth. + * We have an array/list difference here `scalar m{\S+}g` returns `1`, `scalar @{[m{\S+}g]}` returns the number of matches! * Check that there is no pair (with the same parent) for which both nodes are "`*`". Or if it is the last pair that it - contains a single "*". If either of the case the row is "incomplete" and we return the depth. + contains a single "`*`". If either of the case the row is "incomplete" and we return the depth. ```perl sub depth { |