From 157edcf24bd47b084350bbe79e8a2212055f70c6 Mon Sep 17 00:00:00 2001 From: James Smith Date: Mon, 7 Feb 2022 21:42:58 +0000 Subject: Update README.md --- challenge-151/james-smith/README.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/challenge-151/james-smith/README.md b/challenge-151/james-smith/README.md index ccbe61c38d..af952bd3f9 100644 --- a/challenge-151/james-smith/README.md +++ b/challenge-151/james-smith/README.md @@ -26,7 +26,8 @@ The method is to: * 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 { -- cgit